{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JRKZPTXIPGMH3WRZW7CCATI2N3","short_pith_number":"pith:JRKZPTXI","schema_version":"1.0","canonical_sha256":"4c5597cee879987dda39b7c4204d1a6ef73c7ecae65c8dff3173dfb1165f4b18","source":{"kind":"arxiv","id":"1509.07457","version":1},"attestation_state":"computed","paper":{"title":"A simplicial complex is uniquely determined by its set of discrete Morse functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"math.CO","authors_text":"Elias Gabriel Minian, Nicolas Ariel Capitelli","submitted_at":"2015-09-24T18:03:56Z","abstract_excerpt":"We prove that a connected simplicial complex is uniquely determined by its complex of discrete Morse functions. This settles a question raised by Chari and Joswig. In the 1-dimensional case, this implies that the complex of rooted forests of a connected graph G completely determines G."},"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":"1509.07457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-24T18:03:56Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"7a7f050639e42f7438aa423f378819b66991a694952f780fa82ee7b75819e52a","abstract_canon_sha256":"6fac73dcac8abeaad19d8687ffd442e6aa8e7589de67fe43b0c009ab27c36086"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:08.907457Z","signature_b64":"E0OYp5x/IbVcmCwSgBJxzSW2V6uGaNZZs51sSQuzGubDkTIDxVNPIqKTMxrJL4TYQYwn4+e7ESnUip5A6FhVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c5597cee879987dda39b7c4204d1a6ef73c7ecae65c8dff3173dfb1165f4b18","last_reissued_at":"2026-05-18T01:32:08.906755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:08.906755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A simplicial complex is uniquely determined by its set of discrete Morse functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"math.CO","authors_text":"Elias Gabriel Minian, Nicolas Ariel Capitelli","submitted_at":"2015-09-24T18:03:56Z","abstract_excerpt":"We prove that a connected simplicial complex is uniquely determined by its complex of discrete Morse functions. This settles a question raised by Chari and Joswig. In the 1-dimensional case, this implies that the complex of rooted forests of a connected graph G completely determines G."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07457","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":"1509.07457","created_at":"2026-05-18T01:32:08.906871+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.07457v1","created_at":"2026-05-18T01:32:08.906871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07457","created_at":"2026-05-18T01:32:08.906871+00:00"},{"alias_kind":"pith_short_12","alias_value":"JRKZPTXIPGMH","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JRKZPTXIPGMH3WRZ","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JRKZPTXI","created_at":"2026-05-18T12:29:27.538025+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/JRKZPTXIPGMH3WRZW7CCATI2N3","json":"https://pith.science/pith/JRKZPTXIPGMH3WRZW7CCATI2N3.json","graph_json":"https://pith.science/api/pith-number/JRKZPTXIPGMH3WRZW7CCATI2N3/graph.json","events_json":"https://pith.science/api/pith-number/JRKZPTXIPGMH3WRZW7CCATI2N3/events.json","paper":"https://pith.science/paper/JRKZPTXI"},"agent_actions":{"view_html":"https://pith.science/pith/JRKZPTXIPGMH3WRZW7CCATI2N3","download_json":"https://pith.science/pith/JRKZPTXIPGMH3WRZW7CCATI2N3.json","view_paper":"https://pith.science/paper/JRKZPTXI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.07457&json=true","fetch_graph":"https://pith.science/api/pith-number/JRKZPTXIPGMH3WRZW7CCATI2N3/graph.json","fetch_events":"https://pith.science/api/pith-number/JRKZPTXIPGMH3WRZW7CCATI2N3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JRKZPTXIPGMH3WRZW7CCATI2N3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JRKZPTXIPGMH3WRZW7CCATI2N3/action/storage_attestation","attest_author":"https://pith.science/pith/JRKZPTXIPGMH3WRZW7CCATI2N3/action/author_attestation","sign_citation":"https://pith.science/pith/JRKZPTXIPGMH3WRZW7CCATI2N3/action/citation_signature","submit_replication":"https://pith.science/pith/JRKZPTXIPGMH3WRZW7CCATI2N3/action/replication_record"}},"created_at":"2026-05-18T01:32:08.906871+00:00","updated_at":"2026-05-18T01:32:08.906871+00:00"}