{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IDE5FRHLAZPTPMUZNLYK5IUHXC","short_pith_number":"pith:IDE5FRHL","canonical_record":{"source":{"id":"1410.8774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-31T15:27:06Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"95285a3417ba6888172f7d0bd8c525a096d8bc9e95f055bbba5b9b237647e17a","abstract_canon_sha256":"73ed698fe158f3ec2e1953221937860a49a354106a9d02cbd93f23f0fb79a8f0"},"schema_version":"1.0"},"canonical_sha256":"40c9d2c4eb065f37b2996af0aea287b8916ad0c48dbc9b8eb5e4753d059374cf","source":{"kind":"arxiv","id":"1410.8774","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8774","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8774v1","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8774","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"pith_short_12","alias_value":"IDE5FRHLAZPT","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IDE5FRHLAZPTPMUZ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IDE5FRHL","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IDE5FRHLAZPTPMUZNLYK5IUHXC","target":"record","payload":{"canonical_record":{"source":{"id":"1410.8774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-31T15:27:06Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"95285a3417ba6888172f7d0bd8c525a096d8bc9e95f055bbba5b9b237647e17a","abstract_canon_sha256":"73ed698fe158f3ec2e1953221937860a49a354106a9d02cbd93f23f0fb79a8f0"},"schema_version":"1.0"},"canonical_sha256":"40c9d2c4eb065f37b2996af0aea287b8916ad0c48dbc9b8eb5e4753d059374cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:53.727908Z","signature_b64":"HKLAvfPSBZ0CjTdkQpubG9wK7qRfYP1FFykSPYgnycVDpgXElm2TRCUX0eSkJc8YpKsXRMsP3K9r5AjbLeNlBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40c9d2c4eb065f37b2996af0aea287b8916ad0c48dbc9b8eb5e4753d059374cf","last_reissued_at":"2026-05-18T02:38:53.727541Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:53.727541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.8774","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-18T02:38:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nMHjsE0JNogw87miHzP9GzdF3j6H1aK0D3X5cwJM/qmRMCOr5cfQsHDvuy3Vd9et82pDHsuWagVmRmS7WGa7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T16:18:18.802707Z"},"content_sha256":"3d5c495b65df5fedce133baa05f40d0825532ef92c16ff2c6cd46bb14c38cd31","schema_version":"1.0","event_id":"sha256:3d5c495b65df5fedce133baa05f40d0825532ef92c16ff2c6cd46bb14c38cd31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IDE5FRHLAZPTPMUZNLYK5IUHXC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinatorics and algorithms for augmenting graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Dominique de Werra, Konrad K. Dabrowski, Vadim V. Lozin, Viktor Zamaraev","submitted_at":"2014-10-31T15:27:06Z","abstract_excerpt":"The notion of augmenting graphs generalizes Berge's idea of augmenting chains, which was used by Edmonds in his celebrated solution of the maximum matching problem. This problem is a special case of the more general maximum independent set (MIS) problem. Recently, the augmenting graph approach has been successfully applied to solve MIS in various other special cases. However, our knowledge of augmenting graphs is still very limited, and we do not even know what the minimal infinite classes of augmenting graphs are. In the present paper, we find an answer to this question and apply it to extend"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8774","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-18T02:38:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dIJA/qswOLcz/mu4KkQPg/Q78MIHh7+bR372P9j+QYt+AnP3TaznlWLy7HnN/4Og1233Ly8rQLK+0Kzhda3cDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T16:18:18.803038Z"},"content_sha256":"984ecfa3760305433ffd00561b73a2851dc2b2a95534315cb4c89e1894422066","schema_version":"1.0","event_id":"sha256:984ecfa3760305433ffd00561b73a2851dc2b2a95534315cb4c89e1894422066"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IDE5FRHLAZPTPMUZNLYK5IUHXC/bundle.json","state_url":"https://pith.science/pith/IDE5FRHLAZPTPMUZNLYK5IUHXC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IDE5FRHLAZPTPMUZNLYK5IUHXC/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-20T16:18:18Z","links":{"resolver":"https://pith.science/pith/IDE5FRHLAZPTPMUZNLYK5IUHXC","bundle":"https://pith.science/pith/IDE5FRHLAZPTPMUZNLYK5IUHXC/bundle.json","state":"https://pith.science/pith/IDE5FRHLAZPTPMUZNLYK5IUHXC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IDE5FRHLAZPTPMUZNLYK5IUHXC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IDE5FRHLAZPTPMUZNLYK5IUHXC","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":"73ed698fe158f3ec2e1953221937860a49a354106a9d02cbd93f23f0fb79a8f0","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-31T15:27:06Z","title_canon_sha256":"95285a3417ba6888172f7d0bd8c525a096d8bc9e95f055bbba5b9b237647e17a"},"schema_version":"1.0","source":{"id":"1410.8774","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8774","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8774v1","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8774","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"pith_short_12","alias_value":"IDE5FRHLAZPT","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IDE5FRHLAZPTPMUZ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IDE5FRHL","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:984ecfa3760305433ffd00561b73a2851dc2b2a95534315cb4c89e1894422066","target":"graph","created_at":"2026-05-18T02:38: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 notion of augmenting graphs generalizes Berge's idea of augmenting chains, which was used by Edmonds in his celebrated solution of the maximum matching problem. This problem is a special case of the more general maximum independent set (MIS) problem. Recently, the augmenting graph approach has been successfully applied to solve MIS in various other special cases. However, our knowledge of augmenting graphs is still very limited, and we do not even know what the minimal infinite classes of augmenting graphs are. In the present paper, we find an answer to this question and apply it to extend","authors_text":"Dominique de Werra, Konrad K. Dabrowski, Vadim V. Lozin, Viktor Zamaraev","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-31T15:27:06Z","title":"Combinatorics and algorithms for augmenting graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8774","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:3d5c495b65df5fedce133baa05f40d0825532ef92c16ff2c6cd46bb14c38cd31","target":"record","created_at":"2026-05-18T02:38: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":"73ed698fe158f3ec2e1953221937860a49a354106a9d02cbd93f23f0fb79a8f0","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-31T15:27:06Z","title_canon_sha256":"95285a3417ba6888172f7d0bd8c525a096d8bc9e95f055bbba5b9b237647e17a"},"schema_version":"1.0","source":{"id":"1410.8774","kind":"arxiv","version":1}},"canonical_sha256":"40c9d2c4eb065f37b2996af0aea287b8916ad0c48dbc9b8eb5e4753d059374cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40c9d2c4eb065f37b2996af0aea287b8916ad0c48dbc9b8eb5e4753d059374cf","first_computed_at":"2026-05-18T02:38:53.727541Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:53.727541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HKLAvfPSBZ0CjTdkQpubG9wK7qRfYP1FFykSPYgnycVDpgXElm2TRCUX0eSkJc8YpKsXRMsP3K9r5AjbLeNlBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:53.727908Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.8774","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d5c495b65df5fedce133baa05f40d0825532ef92c16ff2c6cd46bb14c38cd31","sha256:984ecfa3760305433ffd00561b73a2851dc2b2a95534315cb4c89e1894422066"],"state_sha256":"4a890ba7832a56097e7bc5f753d154dc1636db9bcea47235d4ba0775e459d42c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KUea8SMTkOC+eb+ciSditDRxqIpcGQJvH1XkxvSQc7PrP8NuH4eAFHLrp9vCazBXtKHMrRX6Nx4fHeJ5RHGOAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T16:18:18.804919Z","bundle_sha256":"c0fac0c2ab1f1c600b19e580bc1b4faff37cefe409202b7f449f4539669e5d1f"}}