{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:C5QOFDAZH33WHER5HJGIJ3CDH4","short_pith_number":"pith:C5QOFDAZ","schema_version":"1.0","canonical_sha256":"1760e28c193ef763923d3a4c84ec433f396defee8d933acf24ff899338f51e14","source":{"kind":"arxiv","id":"1706.07468","version":1},"attestation_state":"computed","paper":{"title":"Uniquely Pressable Graphs: Characterization, Enumeration, and Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hays W. Whitlatch, Joshua N. Cooper","submitted_at":"2017-06-22T19:31:18Z","abstract_excerpt":"We consider \"pressing sequences\", a certain kind of transformation of graphs with loops into empty graphs, motivated by an application in phylogenetics. In particular, we address the question of when a graph has precisely one such pressing sequence, thus answering an question from Cooper and Davis (2015). We characterize uniquely pressable graphs, count the number of them on a given number of vertices, and provide a polynomial time recognition algorithm. We conclude with a few open questions.\n  Keywords: Pressing sequence, adjacency matrix, Cholesky factorization, binary matrix"},"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":"1706.07468","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-22T19:31:18Z","cross_cats_sorted":[],"title_canon_sha256":"28883dbad3abdc239d9efbcd01d34cbf169e067d6560ff1e9de7e0625a76e14d","abstract_canon_sha256":"ffe770f274f03fddb0f63101c4b705ceaa430ffdc31a8aa4b6e5c44a15dece83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:49.011081Z","signature_b64":"w/nGkxJDeGnorYxLi23egcVGwwB616gSgrVWal0w74wtrIV6gKlPH1kzjAL5NXUG+0aa/2nE9/LeS1+zqBw0AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1760e28c193ef763923d3a4c84ec433f396defee8d933acf24ff899338f51e14","last_reissued_at":"2026-05-18T00:41:49.010452Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:49.010452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uniquely Pressable Graphs: Characterization, Enumeration, and Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hays W. Whitlatch, Joshua N. Cooper","submitted_at":"2017-06-22T19:31:18Z","abstract_excerpt":"We consider \"pressing sequences\", a certain kind of transformation of graphs with loops into empty graphs, motivated by an application in phylogenetics. In particular, we address the question of when a graph has precisely one such pressing sequence, thus answering an question from Cooper and Davis (2015). We characterize uniquely pressable graphs, count the number of them on a given number of vertices, and provide a polynomial time recognition algorithm. We conclude with a few open questions.\n  Keywords: Pressing sequence, adjacency matrix, Cholesky factorization, binary matrix"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07468","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":"1706.07468","created_at":"2026-05-18T00:41:49.010551+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.07468v1","created_at":"2026-05-18T00:41:49.010551+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07468","created_at":"2026-05-18T00:41:49.010551+00:00"},{"alias_kind":"pith_short_12","alias_value":"C5QOFDAZH33W","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"C5QOFDAZH33WHER5","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"C5QOFDAZ","created_at":"2026-05-18T12:31:08.081275+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/C5QOFDAZH33WHER5HJGIJ3CDH4","json":"https://pith.science/pith/C5QOFDAZH33WHER5HJGIJ3CDH4.json","graph_json":"https://pith.science/api/pith-number/C5QOFDAZH33WHER5HJGIJ3CDH4/graph.json","events_json":"https://pith.science/api/pith-number/C5QOFDAZH33WHER5HJGIJ3CDH4/events.json","paper":"https://pith.science/paper/C5QOFDAZ"},"agent_actions":{"view_html":"https://pith.science/pith/C5QOFDAZH33WHER5HJGIJ3CDH4","download_json":"https://pith.science/pith/C5QOFDAZH33WHER5HJGIJ3CDH4.json","view_paper":"https://pith.science/paper/C5QOFDAZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.07468&json=true","fetch_graph":"https://pith.science/api/pith-number/C5QOFDAZH33WHER5HJGIJ3CDH4/graph.json","fetch_events":"https://pith.science/api/pith-number/C5QOFDAZH33WHER5HJGIJ3CDH4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C5QOFDAZH33WHER5HJGIJ3CDH4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C5QOFDAZH33WHER5HJGIJ3CDH4/action/storage_attestation","attest_author":"https://pith.science/pith/C5QOFDAZH33WHER5HJGIJ3CDH4/action/author_attestation","sign_citation":"https://pith.science/pith/C5QOFDAZH33WHER5HJGIJ3CDH4/action/citation_signature","submit_replication":"https://pith.science/pith/C5QOFDAZH33WHER5HJGIJ3CDH4/action/replication_record"}},"created_at":"2026-05-18T00:41:49.010551+00:00","updated_at":"2026-05-18T00:41:49.010551+00:00"}