{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZWEAUCF7A6X3K6A7EPABPYEDPP","short_pith_number":"pith:ZWEAUCF7","canonical_record":{"source":{"id":"1304.6870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-25T10:51:32Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"65753236e614befdb1c0aae59e931046b93cd301620e8dee58331df9a98c1da2","abstract_canon_sha256":"c63e59ec3096a7bb399ddb7aa88d818d7ff8e51ba3148dd36759f2593f9719bd"},"schema_version":"1.0"},"canonical_sha256":"cd880a08bf07afb5781f23c017e0837bf21d96844ebade9062e30f19752081e7","source":{"kind":"arxiv","id":"1304.6870","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6870","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6870v1","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6870","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"pith_short_12","alias_value":"ZWEAUCF7A6X3","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZWEAUCF7A6X3K6A7","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZWEAUCF7","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZWEAUCF7A6X3K6A7EPABPYEDPP","target":"record","payload":{"canonical_record":{"source":{"id":"1304.6870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-25T10:51:32Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"65753236e614befdb1c0aae59e931046b93cd301620e8dee58331df9a98c1da2","abstract_canon_sha256":"c63e59ec3096a7bb399ddb7aa88d818d7ff8e51ba3148dd36759f2593f9719bd"},"schema_version":"1.0"},"canonical_sha256":"cd880a08bf07afb5781f23c017e0837bf21d96844ebade9062e30f19752081e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:10.917732Z","signature_b64":"zwnuG0QrG+0Hbgq7nGN7XfiMXGUmu+AaKaw46TpmCys70R5XEfkR1EWSdDxJOABZdA8NeavzNo4cY1QxcoefDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd880a08bf07afb5781f23c017e0837bf21d96844ebade9062e30f19752081e7","last_reissued_at":"2026-05-18T03:27:10.917229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:10.917229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.6870","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-18T03:27:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CJzabPdqNOpS8Rj2S6GB7FY5BqoeSMzey+9sR5v/WPy0GycyQ8JuVrbj7Yl4LP+2BTxJOYSHq4cBCJ09SELvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:03:07.873215Z"},"content_sha256":"8ca81f585098636056525bc2a5a0cbfb443b5aac140a9067bc890aee22d497f9","schema_version":"1.0","event_id":"sha256:8ca81f585098636056525bc2a5a0cbfb443b5aac140a9067bc890aee22d497f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZWEAUCF7A6X3K6A7EPABPYEDPP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum Matching and Linear Programming in Fixed-Point Logic with Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.LO","authors_text":"Anuj Dawar, Bjarki Holm, Matthew Anderson","submitted_at":"2013-04-25T10:51:32Z","abstract_excerpt":"We establish the expressibility in fixed-point logic with counting (FPC) of a number of natural polynomial-time problems. In particular, we show that the size of a maximum matching in a graph is definable in FPC. This settles an open problem first posed by Blass, Gurevich and Shelah, who asked whether the existence of perfect matchings in general graphs could be determined in the more powerful formalism of choiceless polynomial time with counting. Our result is established by showing that the ellipsoid method for solving linear programs can be implemented in FPC. This allows us to prove that l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6870","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-18T03:27:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dUhjyoShdduhtS0lz3MTnVKs1y7L1eOeqvWvlhcVz6yMy8GwmsA7DLxQkdV/R19pFFqO8OlqtA5ih2eVIZZYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:03:07.873588Z"},"content_sha256":"4c97a2a175de8a4fc97b02e32aea0e5d84c2d4637c888584381001a182c8334f","schema_version":"1.0","event_id":"sha256:4c97a2a175de8a4fc97b02e32aea0e5d84c2d4637c888584381001a182c8334f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZWEAUCF7A6X3K6A7EPABPYEDPP/bundle.json","state_url":"https://pith.science/pith/ZWEAUCF7A6X3K6A7EPABPYEDPP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZWEAUCF7A6X3K6A7EPABPYEDPP/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-11T09:03:07Z","links":{"resolver":"https://pith.science/pith/ZWEAUCF7A6X3K6A7EPABPYEDPP","bundle":"https://pith.science/pith/ZWEAUCF7A6X3K6A7EPABPYEDPP/bundle.json","state":"https://pith.science/pith/ZWEAUCF7A6X3K6A7EPABPYEDPP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZWEAUCF7A6X3K6A7EPABPYEDPP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZWEAUCF7A6X3K6A7EPABPYEDPP","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":"c63e59ec3096a7bb399ddb7aa88d818d7ff8e51ba3148dd36759f2593f9719bd","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-25T10:51:32Z","title_canon_sha256":"65753236e614befdb1c0aae59e931046b93cd301620e8dee58331df9a98c1da2"},"schema_version":"1.0","source":{"id":"1304.6870","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6870","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6870v1","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6870","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"pith_short_12","alias_value":"ZWEAUCF7A6X3","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZWEAUCF7A6X3K6A7","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZWEAUCF7","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:4c97a2a175de8a4fc97b02e32aea0e5d84c2d4637c888584381001a182c8334f","target":"graph","created_at":"2026-05-18T03:27:10Z","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 establish the expressibility in fixed-point logic with counting (FPC) of a number of natural polynomial-time problems. In particular, we show that the size of a maximum matching in a graph is definable in FPC. This settles an open problem first posed by Blass, Gurevich and Shelah, who asked whether the existence of perfect matchings in general graphs could be determined in the more powerful formalism of choiceless polynomial time with counting. Our result is established by showing that the ellipsoid method for solving linear programs can be implemented in FPC. This allows us to prove that l","authors_text":"Anuj Dawar, Bjarki Holm, Matthew Anderson","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-25T10:51:32Z","title":"Maximum Matching and Linear Programming in Fixed-Point Logic with Counting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6870","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:8ca81f585098636056525bc2a5a0cbfb443b5aac140a9067bc890aee22d497f9","target":"record","created_at":"2026-05-18T03:27:10Z","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":"c63e59ec3096a7bb399ddb7aa88d818d7ff8e51ba3148dd36759f2593f9719bd","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-25T10:51:32Z","title_canon_sha256":"65753236e614befdb1c0aae59e931046b93cd301620e8dee58331df9a98c1da2"},"schema_version":"1.0","source":{"id":"1304.6870","kind":"arxiv","version":1}},"canonical_sha256":"cd880a08bf07afb5781f23c017e0837bf21d96844ebade9062e30f19752081e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd880a08bf07afb5781f23c017e0837bf21d96844ebade9062e30f19752081e7","first_computed_at":"2026-05-18T03:27:10.917229Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:10.917229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zwnuG0QrG+0Hbgq7nGN7XfiMXGUmu+AaKaw46TpmCys70R5XEfkR1EWSdDxJOABZdA8NeavzNo4cY1QxcoefDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:10.917732Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.6870","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ca81f585098636056525bc2a5a0cbfb443b5aac140a9067bc890aee22d497f9","sha256:4c97a2a175de8a4fc97b02e32aea0e5d84c2d4637c888584381001a182c8334f"],"state_sha256":"d9c7d423a84893afd17dd0dc58924416864f1b29dd2dedf1b46e1b95e779b145"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M22x70LkUlo8OJOzPDqQ5uV/IoIx10nkQGpX5AKqyqxQjXDD/ppQ/moPKP6nynFctv+LNtEgq6K1CEDKarWGDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:03:07.875653Z","bundle_sha256":"15be2c251c69274b773a80cd5df5d1ec84496b702c84e79599f28ecd2d02e066"}}