{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SOOU5W45HI3BVB35RDDD2XW56P","short_pith_number":"pith:SOOU5W45","schema_version":"1.0","canonical_sha256":"939d4edb9d3a361a877d88c63d5eddf3fe08f0aa1b1db756093f8c35922cdfa5","source":{"kind":"arxiv","id":"1506.06819","version":1},"attestation_state":"computed","paper":{"title":"Simplicial and Cellular Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Art M. Duval, Caroline J. Klivans, Jeremy L. Martin","submitted_at":"2015-06-22T23:37:00Z","abstract_excerpt":"Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed first by Bolker, Kalai and Adin, and more recently by numerous authors, the fundamental topological properties of a tree --- namely acyclicity and connectedness --- can be generalized to arbitrary dimension as the vanishing of certain cellular homology groups. This point of view is consistent with the matroid-theoretic approach to graphs, and yields higher-"},"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":"1506.06819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-22T23:37:00Z","cross_cats_sorted":[],"title_canon_sha256":"679d9b83574643f1cd7069cc96a125a12070041410a7be59f8e4367695965c63","abstract_canon_sha256":"e6a7c936836df94b786b6843c3606ecfe04950c34e1280a0f233b46e023002a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:40:55.907769Z","signature_b64":"9pRtVKiPz2A4EyAyJkOA4MYxyvpzLHHzJC5onAJnoYel/BhzxWDbQ22H3t2kaFp6RKgQUY5xxSwJI8od7qh7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"939d4edb9d3a361a877d88c63d5eddf3fe08f0aa1b1db756093f8c35922cdfa5","last_reissued_at":"2026-05-18T01:40:55.907055Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:40:55.907055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simplicial and Cellular Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Art M. Duval, Caroline J. Klivans, Jeremy L. Martin","submitted_at":"2015-06-22T23:37:00Z","abstract_excerpt":"Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed first by Bolker, Kalai and Adin, and more recently by numerous authors, the fundamental topological properties of a tree --- namely acyclicity and connectedness --- can be generalized to arbitrary dimension as the vanishing of certain cellular homology groups. This point of view is consistent with the matroid-theoretic approach to graphs, and yields higher-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06819","kind":"arxiv","version":1},"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":"1506.06819","created_at":"2026-05-18T01:40:55.907160+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.06819v1","created_at":"2026-05-18T01:40:55.907160+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06819","created_at":"2026-05-18T01:40:55.907160+00:00"},{"alias_kind":"pith_short_12","alias_value":"SOOU5W45HI3B","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SOOU5W45HI3BVB35","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SOOU5W45","created_at":"2026-05-18T12:29:42.218222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.25671","citing_title":"Arithmetical Structures on Ladder Graphs","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SOOU5W45HI3BVB35RDDD2XW56P","json":"https://pith.science/pith/SOOU5W45HI3BVB35RDDD2XW56P.json","graph_json":"https://pith.science/api/pith-number/SOOU5W45HI3BVB35RDDD2XW56P/graph.json","events_json":"https://pith.science/api/pith-number/SOOU5W45HI3BVB35RDDD2XW56P/events.json","paper":"https://pith.science/paper/SOOU5W45"},"agent_actions":{"view_html":"https://pith.science/pith/SOOU5W45HI3BVB35RDDD2XW56P","download_json":"https://pith.science/pith/SOOU5W45HI3BVB35RDDD2XW56P.json","view_paper":"https://pith.science/paper/SOOU5W45","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.06819&json=true","fetch_graph":"https://pith.science/api/pith-number/SOOU5W45HI3BVB35RDDD2XW56P/graph.json","fetch_events":"https://pith.science/api/pith-number/SOOU5W45HI3BVB35RDDD2XW56P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SOOU5W45HI3BVB35RDDD2XW56P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SOOU5W45HI3BVB35RDDD2XW56P/action/storage_attestation","attest_author":"https://pith.science/pith/SOOU5W45HI3BVB35RDDD2XW56P/action/author_attestation","sign_citation":"https://pith.science/pith/SOOU5W45HI3BVB35RDDD2XW56P/action/citation_signature","submit_replication":"https://pith.science/pith/SOOU5W45HI3BVB35RDDD2XW56P/action/replication_record"}},"created_at":"2026-05-18T01:40:55.907160+00:00","updated_at":"2026-05-18T01:40:55.907160+00:00"}