{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AYGFJEABVFZ55WQ4FVFWDTQAWQ","short_pith_number":"pith:AYGFJEAB","schema_version":"1.0","canonical_sha256":"060c549001a973deda1c2d4b61ce00b4245399edb5b7e22855631519d0cdfa8b","source":{"kind":"arxiv","id":"1807.08079","version":2},"attestation_state":"computed","paper":{"title":"How to Build a Graph in n Days: Some Variants on Graph Assembly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aria Dougherty, Nick Mayers, Robert Short","submitted_at":"2018-07-21T03:44:46Z","abstract_excerpt":"In a recent article by M. Bona and A. Vince, the authors introduced the concept of an assembly tree for a graph. Assembly trees act as record keeping devices for the construction of a given graph from its vertices. In this paper we extend the work initiated by M. Bona and A. Vince as well as define and examine a more generalized definition of assembly tree."},"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":"1807.08079","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-21T03:44:46Z","cross_cats_sorted":[],"title_canon_sha256":"5adeaeac4b3906e1e3363702cc2a0388a0ffaa1669922b8d55f8f13c4d99099e","abstract_canon_sha256":"eb971dd7ffc808393af9a2bd70324797d2913d2dc85dafe76c4ee7293acf9f5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:29.105086Z","signature_b64":"s38wlKr17WPsEcOP1a96B2RSFKM3I4B5GNl9qrGfcw0W4nx+X18ec3kHWtRiwEzFFyl3ey5GZvprz6N7E6Q4DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"060c549001a973deda1c2d4b61ce00b4245399edb5b7e22855631519d0cdfa8b","last_reissued_at":"2026-05-17T23:55:29.104690Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:29.104690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to Build a Graph in n Days: Some Variants on Graph Assembly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aria Dougherty, Nick Mayers, Robert Short","submitted_at":"2018-07-21T03:44:46Z","abstract_excerpt":"In a recent article by M. Bona and A. Vince, the authors introduced the concept of an assembly tree for a graph. Assembly trees act as record keeping devices for the construction of a given graph from its vertices. In this paper we extend the work initiated by M. Bona and A. Vince as well as define and examine a more generalized definition of assembly tree."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08079","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":"1807.08079","created_at":"2026-05-17T23:55:29.104763+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.08079v2","created_at":"2026-05-17T23:55:29.104763+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08079","created_at":"2026-05-17T23:55:29.104763+00:00"},{"alias_kind":"pith_short_12","alias_value":"AYGFJEABVFZ5","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AYGFJEABVFZ55WQ4","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AYGFJEAB","created_at":"2026-05-18T12:32:13.499390+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/AYGFJEABVFZ55WQ4FVFWDTQAWQ","json":"https://pith.science/pith/AYGFJEABVFZ55WQ4FVFWDTQAWQ.json","graph_json":"https://pith.science/api/pith-number/AYGFJEABVFZ55WQ4FVFWDTQAWQ/graph.json","events_json":"https://pith.science/api/pith-number/AYGFJEABVFZ55WQ4FVFWDTQAWQ/events.json","paper":"https://pith.science/paper/AYGFJEAB"},"agent_actions":{"view_html":"https://pith.science/pith/AYGFJEABVFZ55WQ4FVFWDTQAWQ","download_json":"https://pith.science/pith/AYGFJEABVFZ55WQ4FVFWDTQAWQ.json","view_paper":"https://pith.science/paper/AYGFJEAB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.08079&json=true","fetch_graph":"https://pith.science/api/pith-number/AYGFJEABVFZ55WQ4FVFWDTQAWQ/graph.json","fetch_events":"https://pith.science/api/pith-number/AYGFJEABVFZ55WQ4FVFWDTQAWQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AYGFJEABVFZ55WQ4FVFWDTQAWQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AYGFJEABVFZ55WQ4FVFWDTQAWQ/action/storage_attestation","attest_author":"https://pith.science/pith/AYGFJEABVFZ55WQ4FVFWDTQAWQ/action/author_attestation","sign_citation":"https://pith.science/pith/AYGFJEABVFZ55WQ4FVFWDTQAWQ/action/citation_signature","submit_replication":"https://pith.science/pith/AYGFJEABVFZ55WQ4FVFWDTQAWQ/action/replication_record"}},"created_at":"2026-05-17T23:55:29.104763+00:00","updated_at":"2026-05-17T23:55:29.104763+00:00"}