{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DYNSFITYBCZAH7VZ6HXLS7T6DQ","short_pith_number":"pith:DYNSFITY","schema_version":"1.0","canonical_sha256":"1e1b22a27808b203feb9f1eeb97e7e1c3b7841b4e72e98a8e54dbd9b01f0fcb3","source":{"kind":"arxiv","id":"1202.2724","version":1},"attestation_state":"computed","paper":{"title":"Combinatorial Morse flows are hard to find","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"math.GT","authors_text":"Liviu I. Nicolaescu","submitted_at":"2012-02-13T13:35:46Z","abstract_excerpt":"We investigate the probability of detecting combinatorial Morse flows on a simplicial complex via a random search. We prove that it is really small, in a quantifiable way."},"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":"1202.2724","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2012-02-13T13:35:46Z","cross_cats_sorted":["math.CO","math.PR"],"title_canon_sha256":"b7cc82c28c62c7e0874626f99195539951e7fc3c0f0bf4d548a40457221f552b","abstract_canon_sha256":"211b7bbd3e79a56b5992fb29b17a90a64d182b8d6daf30dae2473aa3e1e0e7a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:25.836337Z","signature_b64":"2DBWy+iPb3BfsYq2qgkNC7b6iTlDwchDx/HLqMAROcOiXK7seNAGBakySMaCJoXMx5caaVp6eB4czGkdhSDQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e1b22a27808b203feb9f1eeb97e7e1c3b7841b4e72e98a8e54dbd9b01f0fcb3","last_reissued_at":"2026-05-18T04:02:25.835831Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:25.835831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial Morse flows are hard to find","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"math.GT","authors_text":"Liviu I. Nicolaescu","submitted_at":"2012-02-13T13:35:46Z","abstract_excerpt":"We investigate the probability of detecting combinatorial Morse flows on a simplicial complex via a random search. We prove that it is really small, in a quantifiable way."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2724","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":"1202.2724","created_at":"2026-05-18T04:02:25.835903+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.2724v1","created_at":"2026-05-18T04:02:25.835903+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2724","created_at":"2026-05-18T04:02:25.835903+00:00"},{"alias_kind":"pith_short_12","alias_value":"DYNSFITYBCZA","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"DYNSFITYBCZAH7VZ","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"DYNSFITY","created_at":"2026-05-18T12:27:04.183437+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/DYNSFITYBCZAH7VZ6HXLS7T6DQ","json":"https://pith.science/pith/DYNSFITYBCZAH7VZ6HXLS7T6DQ.json","graph_json":"https://pith.science/api/pith-number/DYNSFITYBCZAH7VZ6HXLS7T6DQ/graph.json","events_json":"https://pith.science/api/pith-number/DYNSFITYBCZAH7VZ6HXLS7T6DQ/events.json","paper":"https://pith.science/paper/DYNSFITY"},"agent_actions":{"view_html":"https://pith.science/pith/DYNSFITYBCZAH7VZ6HXLS7T6DQ","download_json":"https://pith.science/pith/DYNSFITYBCZAH7VZ6HXLS7T6DQ.json","view_paper":"https://pith.science/paper/DYNSFITY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.2724&json=true","fetch_graph":"https://pith.science/api/pith-number/DYNSFITYBCZAH7VZ6HXLS7T6DQ/graph.json","fetch_events":"https://pith.science/api/pith-number/DYNSFITYBCZAH7VZ6HXLS7T6DQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DYNSFITYBCZAH7VZ6HXLS7T6DQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DYNSFITYBCZAH7VZ6HXLS7T6DQ/action/storage_attestation","attest_author":"https://pith.science/pith/DYNSFITYBCZAH7VZ6HXLS7T6DQ/action/author_attestation","sign_citation":"https://pith.science/pith/DYNSFITYBCZAH7VZ6HXLS7T6DQ/action/citation_signature","submit_replication":"https://pith.science/pith/DYNSFITYBCZAH7VZ6HXLS7T6DQ/action/replication_record"}},"created_at":"2026-05-18T04:02:25.835903+00:00","updated_at":"2026-05-18T04:02:25.835903+00:00"}