{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JQHGLRNYZ2JHLSK42XR6SQWBE5","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":"fb8f38e2130063ab7c13312bca756729bc68eb1f78a7f4224da68b35d4426bc4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-12T17:12:58Z","title_canon_sha256":"d00b7f133fadb9b4ea6f4cf4df22124a05217f849849eb080533cde212af18d9"},"schema_version":"1.0","source":{"id":"1702.03546","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03546","created_at":"2026-05-18T00:50:53Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03546v1","created_at":"2026-05-18T00:50:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03546","created_at":"2026-05-18T00:50:53Z"},{"alias_kind":"pith_short_12","alias_value":"JQHGLRNYZ2JH","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JQHGLRNYZ2JHLSK4","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JQHGLRNY","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:8483440eb2217971a4661946bceb3b2c8b2a3b3c3644216b553fd3ce5cfe18fe","target":"graph","created_at":"2026-05-18T00:50:53Z","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":"The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving graph properties. In addition, we can show that the bipartition polynomial is polynomially reconstructible, which means that we can recover it from the multiset of bipartition polynomials of one-edge-deleted subgraphs.","authors_text":"Peter Tittmann, Seongmin Ok","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-12T17:12:58Z","title":"The Bipartition Polynomial of a Graph: Reconstruction, Decomposition, and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03546","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:160565417464f36797bf2198b1a14023fb6e0e74e29dfe03198079d882fb8e70","target":"record","created_at":"2026-05-18T00:50:53Z","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":"fb8f38e2130063ab7c13312bca756729bc68eb1f78a7f4224da68b35d4426bc4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-12T17:12:58Z","title_canon_sha256":"d00b7f133fadb9b4ea6f4cf4df22124a05217f849849eb080533cde212af18d9"},"schema_version":"1.0","source":{"id":"1702.03546","kind":"arxiv","version":1}},"canonical_sha256":"4c0e65c5b8ce9275c95cd5e3e942c1277904ded47cc94cc8cd680ef01447d607","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c0e65c5b8ce9275c95cd5e3e942c1277904ded47cc94cc8cd680ef01447d607","first_computed_at":"2026-05-18T00:50:53.550590Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:53.550590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F8jrJHrZpektzlUYIZJ2xKo2oV9wRqrCC9fxM+toqk/MT+qMVwIOHJ1oxGoRF14ytQ4R0TmbVoulRYmQnkcnAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:53.553289Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.03546","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:160565417464f36797bf2198b1a14023fb6e0e74e29dfe03198079d882fb8e70","sha256:8483440eb2217971a4661946bceb3b2c8b2a3b3c3644216b553fd3ce5cfe18fe"],"state_sha256":"5022d2b96b33d0d6920ebe95a3e596ef4ab93690375c6596379154bde0c2e44f"}