{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GNKLU452C2XN5HY7VCQMK4RIDS","short_pith_number":"pith:GNKLU452","schema_version":"1.0","canonical_sha256":"3354ba73ba16aede9f1fa8a0c572281c9f9807ba0d4a1228af326526e8532663","source":{"kind":"arxiv","id":"1403.8109","version":2},"attestation_state":"computed","paper":{"title":"A Study on Sprout Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johan Kok, Naduvath Sudev","submitted_at":"2014-03-27T07:48:59Z","abstract_excerpt":"Sprout graphs are finite directed graphs matured over a finite subset of the non-negative time line. A simple undirected connected graph on at least two vertices is required to construct an infant graph to mature from. The maxi-max arc-weight principle and the maxi-min arc-weight principle are introduced in the paper. These principles are used to determine the maximum and minimum maturity weight of a sprout graph."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1403.8109","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2014-03-27T07:48:59Z","cross_cats_sorted":[],"title_canon_sha256":"85df6f0bdc36611304cebca9c61baaba9e6fbfa0af8a17f8916f1ce06dd0f5af","abstract_canon_sha256":"f78aab9f1d4228a81d3c58cbb2b675be5af673364605db40ec4ac88308e1d1ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:50.834716Z","signature_b64":"mVnlQuqAwPo/6r6PNWHkVN38Q2PxPBx+gU534wNfhZVG1ey95c//VypT5A4LgYRTjLCPjc3UwmPqyOpvu32uDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3354ba73ba16aede9f1fa8a0c572281c9f9807ba0d4a1228af326526e8532663","last_reissued_at":"2026-05-18T01:32:50.834034Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:50.834034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Study on Sprout Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johan Kok, Naduvath Sudev","submitted_at":"2014-03-27T07:48:59Z","abstract_excerpt":"Sprout graphs are finite directed graphs matured over a finite subset of the non-negative time line. A simple undirected connected graph on at least two vertices is required to construct an infant graph to mature from. The maxi-max arc-weight principle and the maxi-min arc-weight principle are introduced in the paper. These principles are used to determine the maximum and minimum maturity weight of a sprout graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.8109","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1403.8109","created_at":"2026-05-18T01:32:50.834151+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.8109v2","created_at":"2026-05-18T01:32:50.834151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.8109","created_at":"2026-05-18T01:32:50.834151+00:00"},{"alias_kind":"pith_short_12","alias_value":"GNKLU452C2XN","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GNKLU452C2XN5HY7","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GNKLU452","created_at":"2026-05-18T12:28:30.664211+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GNKLU452C2XN5HY7VCQMK4RIDS","json":"https://pith.science/pith/GNKLU452C2XN5HY7VCQMK4RIDS.json","graph_json":"https://pith.science/api/pith-number/GNKLU452C2XN5HY7VCQMK4RIDS/graph.json","events_json":"https://pith.science/api/pith-number/GNKLU452C2XN5HY7VCQMK4RIDS/events.json","paper":"https://pith.science/paper/GNKLU452"},"agent_actions":{"view_html":"https://pith.science/pith/GNKLU452C2XN5HY7VCQMK4RIDS","download_json":"https://pith.science/pith/GNKLU452C2XN5HY7VCQMK4RIDS.json","view_paper":"https://pith.science/paper/GNKLU452","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.8109&json=true","fetch_graph":"https://pith.science/api/pith-number/GNKLU452C2XN5HY7VCQMK4RIDS/graph.json","fetch_events":"https://pith.science/api/pith-number/GNKLU452C2XN5HY7VCQMK4RIDS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GNKLU452C2XN5HY7VCQMK4RIDS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GNKLU452C2XN5HY7VCQMK4RIDS/action/storage_attestation","attest_author":"https://pith.science/pith/GNKLU452C2XN5HY7VCQMK4RIDS/action/author_attestation","sign_citation":"https://pith.science/pith/GNKLU452C2XN5HY7VCQMK4RIDS/action/citation_signature","submit_replication":"https://pith.science/pith/GNKLU452C2XN5HY7VCQMK4RIDS/action/replication_record"}},"created_at":"2026-05-18T01:32:50.834151+00:00","updated_at":"2026-05-18T01:32:50.834151+00:00"}