{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SHTZUSCTC4PGJ5UN6DE57P4SFT","short_pith_number":"pith:SHTZUSCT","schema_version":"1.0","canonical_sha256":"91e79a4853171e64f68df0c9dfbf922cfd2bd208f3beaf461682f6433f5b1f1d","source":{"kind":"arxiv","id":"1502.07450","version":5},"attestation_state":"computed","paper":{"title":"Successful Pressing Sequences for a Bicolored Graph and Binary Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jeffrey Davis, Joshua Cooper","submitted_at":"2015-02-26T06:19:15Z","abstract_excerpt":"We apply matrix theory over $\\mathbb{F}_2$ to understand the nature of so-called \"successful pressing sequences\" of black-and-white vertex-colored graphs. These sequences arise in computational phylogenetics, where, by a celebrated result of Hannenhalli and Pevzner, the space of sortings-by-reversal of a signed permutation can be described by pressing sequences. In particular, we offer several alternative linear-algebraic and graph-theoretic characterizations of successful pressing sequences, describe the relation between such sequences, and provide bounds on the number of them. We also offer "},"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":"1502.07450","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-26T06:19:15Z","cross_cats_sorted":[],"title_canon_sha256":"c0b355b3d9720e4b344e6005a4e718ab7e529f1ac4d1c68e0a364e91a8fe1ad0","abstract_canon_sha256":"8decdbe50e715df520266da8f59bb4d7d8feec164bd04a36b0373bca7b7c4685"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:00.829447Z","signature_b64":"jFetm6bko6QcWmeOIi9obB/uWcY3NfQWdcQPKZwfBSyN4HyM3pdJ9bzCa1cjDvqDwNfudOBRQycTb3rvno7TBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91e79a4853171e64f68df0c9dfbf922cfd2bd208f3beaf461682f6433f5b1f1d","last_reissued_at":"2026-05-18T01:32:00.828895Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:00.828895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Successful Pressing Sequences for a Bicolored Graph and Binary Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jeffrey Davis, Joshua Cooper","submitted_at":"2015-02-26T06:19:15Z","abstract_excerpt":"We apply matrix theory over $\\mathbb{F}_2$ to understand the nature of so-called \"successful pressing sequences\" of black-and-white vertex-colored graphs. These sequences arise in computational phylogenetics, where, by a celebrated result of Hannenhalli and Pevzner, the space of sortings-by-reversal of a signed permutation can be described by pressing sequences. In particular, we offer several alternative linear-algebraic and graph-theoretic characterizations of successful pressing sequences, describe the relation between such sequences, and provide bounds on the number of them. We also offer "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07450","kind":"arxiv","version":5},"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":"1502.07450","created_at":"2026-05-18T01:32:00.829004+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.07450v5","created_at":"2026-05-18T01:32:00.829004+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07450","created_at":"2026-05-18T01:32:00.829004+00:00"},{"alias_kind":"pith_short_12","alias_value":"SHTZUSCTC4PG","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SHTZUSCTC4PGJ5UN","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SHTZUSCT","created_at":"2026-05-18T12:29:42.218222+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/SHTZUSCTC4PGJ5UN6DE57P4SFT","json":"https://pith.science/pith/SHTZUSCTC4PGJ5UN6DE57P4SFT.json","graph_json":"https://pith.science/api/pith-number/SHTZUSCTC4PGJ5UN6DE57P4SFT/graph.json","events_json":"https://pith.science/api/pith-number/SHTZUSCTC4PGJ5UN6DE57P4SFT/events.json","paper":"https://pith.science/paper/SHTZUSCT"},"agent_actions":{"view_html":"https://pith.science/pith/SHTZUSCTC4PGJ5UN6DE57P4SFT","download_json":"https://pith.science/pith/SHTZUSCTC4PGJ5UN6DE57P4SFT.json","view_paper":"https://pith.science/paper/SHTZUSCT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.07450&json=true","fetch_graph":"https://pith.science/api/pith-number/SHTZUSCTC4PGJ5UN6DE57P4SFT/graph.json","fetch_events":"https://pith.science/api/pith-number/SHTZUSCTC4PGJ5UN6DE57P4SFT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SHTZUSCTC4PGJ5UN6DE57P4SFT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SHTZUSCTC4PGJ5UN6DE57P4SFT/action/storage_attestation","attest_author":"https://pith.science/pith/SHTZUSCTC4PGJ5UN6DE57P4SFT/action/author_attestation","sign_citation":"https://pith.science/pith/SHTZUSCTC4PGJ5UN6DE57P4SFT/action/citation_signature","submit_replication":"https://pith.science/pith/SHTZUSCTC4PGJ5UN6DE57P4SFT/action/replication_record"}},"created_at":"2026-05-18T01:32:00.829004+00:00","updated_at":"2026-05-18T01:32:00.829004+00:00"}