{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:C5QOFDAZH33WHER5HJGIJ3CDH4","short_pith_number":"pith:C5QOFDAZ","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"},"canonical_sha256":"1760e28c193ef763923d3a4c84ec433f396defee8d933acf24ff899338f51e14","source":{"kind":"arxiv","id":"1706.07468","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07468","created_at":"2026-05-18T00:41:49Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07468v1","created_at":"2026-05-18T00:41:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07468","created_at":"2026-05-18T00:41:49Z"},{"alias_kind":"pith_short_12","alias_value":"C5QOFDAZH33W","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"C5QOFDAZH33WHER5","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"C5QOFDAZ","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:C5QOFDAZH33WHER5HJGIJ3CDH4","target":"record","payload":{"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"},"canonical_sha256":"1760e28c193ef763923d3a4c84ec433f396defee8d933acf24ff899338f51e14","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"},"source_kind":"arxiv","source_id":"1706.07468","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:41:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"warrRe0rqYroIl8tnkDoVlnZ0wIAEg/O3gO6LcHNeIhOAmHwvVGw2/q8dWIVN4HDzSkTKlXplFqv2MAAOefuCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T21:09:12.259380Z"},"content_sha256":"d10a005559787fc2bfff53d75db6d01c41e1ea5e06beedfbd814dc3e63fc0363","schema_version":"1.0","event_id":"sha256:d10a005559787fc2bfff53d75db6d01c41e1ea5e06beedfbd814dc3e63fc0363"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:C5QOFDAZH33WHER5HJGIJ3CDH4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:41:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A340RVa+N5LqBCQPEgcj8s+k3pdW3Y2tW6Ap1jp7QYttng1kbeY/N134FfMTxolaQRmuXszJVuxk16qJY7YlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T21:09:12.259740Z"},"content_sha256":"4ddefa47a5dbf789b0d7f11c10fccb6840408f62d526f8bf7c2972985e5783ce","schema_version":"1.0","event_id":"sha256:4ddefa47a5dbf789b0d7f11c10fccb6840408f62d526f8bf7c2972985e5783ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5QOFDAZH33WHER5HJGIJ3CDH4/bundle.json","state_url":"https://pith.science/pith/C5QOFDAZH33WHER5HJGIJ3CDH4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5QOFDAZH33WHER5HJGIJ3CDH4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T21:09:12Z","links":{"resolver":"https://pith.science/pith/C5QOFDAZH33WHER5HJGIJ3CDH4","bundle":"https://pith.science/pith/C5QOFDAZH33WHER5HJGIJ3CDH4/bundle.json","state":"https://pith.science/pith/C5QOFDAZH33WHER5HJGIJ3CDH4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5QOFDAZH33WHER5HJGIJ3CDH4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:C5QOFDAZH33WHER5HJGIJ3CDH4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ffe770f274f03fddb0f63101c4b705ceaa430ffdc31a8aa4b6e5c44a15dece83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-22T19:31:18Z","title_canon_sha256":"28883dbad3abdc239d9efbcd01d34cbf169e067d6560ff1e9de7e0625a76e14d"},"schema_version":"1.0","source":{"id":"1706.07468","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07468","created_at":"2026-05-18T00:41:49Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07468v1","created_at":"2026-05-18T00:41:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07468","created_at":"2026-05-18T00:41:49Z"},{"alias_kind":"pith_short_12","alias_value":"C5QOFDAZH33W","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"C5QOFDAZH33WHER5","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"C5QOFDAZ","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:4ddefa47a5dbf789b0d7f11c10fccb6840408f62d526f8bf7c2972985e5783ce","target":"graph","created_at":"2026-05-18T00:41:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Hays W. Whitlatch, Joshua N. Cooper","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-22T19:31:18Z","title":"Uniquely Pressable Graphs: Characterization, Enumeration, and Recognition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07468","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d10a005559787fc2bfff53d75db6d01c41e1ea5e06beedfbd814dc3e63fc0363","target":"record","created_at":"2026-05-18T00:41:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ffe770f274f03fddb0f63101c4b705ceaa430ffdc31a8aa4b6e5c44a15dece83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-22T19:31:18Z","title_canon_sha256":"28883dbad3abdc239d9efbcd01d34cbf169e067d6560ff1e9de7e0625a76e14d"},"schema_version":"1.0","source":{"id":"1706.07468","kind":"arxiv","version":1}},"canonical_sha256":"1760e28c193ef763923d3a4c84ec433f396defee8d933acf24ff899338f51e14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1760e28c193ef763923d3a4c84ec433f396defee8d933acf24ff899338f51e14","first_computed_at":"2026-05-18T00:41:49.010452Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:49.010452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w/nGkxJDeGnorYxLi23egcVGwwB616gSgrVWal0w74wtrIV6gKlPH1kzjAL5NXUG+0aa/2nE9/LeS1+zqBw0AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:49.011081Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.07468","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d10a005559787fc2bfff53d75db6d01c41e1ea5e06beedfbd814dc3e63fc0363","sha256:4ddefa47a5dbf789b0d7f11c10fccb6840408f62d526f8bf7c2972985e5783ce"],"state_sha256":"ced06e4497c0d9b4192acbd71c439b3397c5b7f60512f5ba4758543ba1273815"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"deIZSEmVKvLg0H+gj1N1aOpFshjIVzvGUS9lHrJh9j+VcL/AfeAWUQq+FoYh2FXI8YKIAZ3uf++iEe31g11WDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T21:09:12.261689Z","bundle_sha256":"956b55944e1d8427f37a6a39efcf307e0aea90532e1a9d8a0a6891d65895e356"}}