{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WZTE23VGKWEVG7YD2KLYEIHXWA","short_pith_number":"pith:WZTE23VG","schema_version":"1.0","canonical_sha256":"b6664d6ea65589537f03d2978220f7b0054d3d1beb0095c5b595d0e8c599c9e0","source":{"kind":"arxiv","id":"2505.08580","version":1},"attestation_state":"computed","paper":{"title":"When are Morse resolutions polyhedral?","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Dharm Veer, Hasan Mahmood, Iresha Madduwe Hewalage, Kyle Wang, Louis Bu, Sara Faridi, Scott Wesley, Thiago Holleben","submitted_at":"2025-05-13T13:55:25Z","abstract_excerpt":"It is known that the chain complex of a simplex on $q$ vertices can be used to construct a free resolution of any ideal generated by $q$ monomials, and as a direct result, the Betti numbers always have binomial upper bounds, given by the number of faces of a simplex in each dimension.\n  It is also known that for most monomials the resolution provided by the simplex is far from minimal. Discrete Morse theory provides an algorithm called \\say{Morse matchings} by which faces of the simplex can be removed so that the chain complex on the remaining faces is still a free resolution of the same ideal"},"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":"2505.08580","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.AC","submitted_at":"2025-05-13T13:55:25Z","cross_cats_sorted":[],"title_canon_sha256":"54f2c3f722e64881fbeb8b65bef31a867cbcbbde4937b3b3039d1c451fd05bdd","abstract_canon_sha256":"3aca1f6c65aeacfe4f58275fc880573ab61189d0009f24e0a5ada0467e48a37a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:02:32.930047Z","signature_b64":"gpPdx+RfuTbbH4csOsbLpbkAy+SSPIwkICrUcft9wjTW4YbpzAT6JRafnhaMoimqbSiba8sy6tXIjNUHoA2BAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6664d6ea65589537f03d2978220f7b0054d3d1beb0095c5b595d0e8c599c9e0","last_reissued_at":"2026-07-05T11:02:32.929527Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:02:32.929527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"When are Morse resolutions polyhedral?","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Dharm Veer, Hasan Mahmood, Iresha Madduwe Hewalage, Kyle Wang, Louis Bu, Sara Faridi, Scott Wesley, Thiago Holleben","submitted_at":"2025-05-13T13:55:25Z","abstract_excerpt":"It is known that the chain complex of a simplex on $q$ vertices can be used to construct a free resolution of any ideal generated by $q$ monomials, and as a direct result, the Betti numbers always have binomial upper bounds, given by the number of faces of a simplex in each dimension.\n  It is also known that for most monomials the resolution provided by the simplex is far from minimal. Discrete Morse theory provides an algorithm called \\say{Morse matchings} by which faces of the simplex can be removed so that the chain complex on the remaining faces is still a free resolution of the same ideal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.08580","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.08580/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.08580","created_at":"2026-07-05T11:02:32.929601+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.08580v1","created_at":"2026-07-05T11:02:32.929601+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.08580","created_at":"2026-07-05T11:02:32.929601+00:00"},{"alias_kind":"pith_short_12","alias_value":"WZTE23VGKWEV","created_at":"2026-07-05T11:02:32.929601+00:00"},{"alias_kind":"pith_short_16","alias_value":"WZTE23VGKWEVG7YD","created_at":"2026-07-05T11:02:32.929601+00:00"},{"alias_kind":"pith_short_8","alias_value":"WZTE23VG","created_at":"2026-07-05T11:02:32.929601+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.22280","citing_title":"Cellular resolutions of second powers of square-free monomial ideals with divisibility relations","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WZTE23VGKWEVG7YD2KLYEIHXWA","json":"https://pith.science/pith/WZTE23VGKWEVG7YD2KLYEIHXWA.json","graph_json":"https://pith.science/api/pith-number/WZTE23VGKWEVG7YD2KLYEIHXWA/graph.json","events_json":"https://pith.science/api/pith-number/WZTE23VGKWEVG7YD2KLYEIHXWA/events.json","paper":"https://pith.science/paper/WZTE23VG"},"agent_actions":{"view_html":"https://pith.science/pith/WZTE23VGKWEVG7YD2KLYEIHXWA","download_json":"https://pith.science/pith/WZTE23VGKWEVG7YD2KLYEIHXWA.json","view_paper":"https://pith.science/paper/WZTE23VG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.08580&json=true","fetch_graph":"https://pith.science/api/pith-number/WZTE23VGKWEVG7YD2KLYEIHXWA/graph.json","fetch_events":"https://pith.science/api/pith-number/WZTE23VGKWEVG7YD2KLYEIHXWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WZTE23VGKWEVG7YD2KLYEIHXWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WZTE23VGKWEVG7YD2KLYEIHXWA/action/storage_attestation","attest_author":"https://pith.science/pith/WZTE23VGKWEVG7YD2KLYEIHXWA/action/author_attestation","sign_citation":"https://pith.science/pith/WZTE23VGKWEVG7YD2KLYEIHXWA/action/citation_signature","submit_replication":"https://pith.science/pith/WZTE23VGKWEVG7YD2KLYEIHXWA/action/replication_record"}},"created_at":"2026-07-05T11:02:32.929601+00:00","updated_at":"2026-07-05T11:02:32.929601+00:00"}