{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:EQUBPXZIME5QYSD4EBKE3SW7QB","short_pith_number":"pith:EQUBPXZI","canonical_record":{"source":{"id":"1203.1084","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-06T01:47:45Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"190aac596e5bf3db6591a9f0e2dd5cfd66c1003a4675338965f826de7be3516a","abstract_canon_sha256":"40e11c645d0b73cfba69b27307e3818382bce85909f1038d480d42ef88c8b385"},"schema_version":"1.0"},"canonical_sha256":"242817df28613b0c487c20544dcadf8079851666c076f5946d54934c12fada83","source":{"kind":"arxiv","id":"1203.1084","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1084","created_at":"2026-05-18T04:00:48Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1084v1","created_at":"2026-05-18T04:00:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1084","created_at":"2026-05-18T04:00:48Z"},{"alias_kind":"pith_short_12","alias_value":"EQUBPXZIME5Q","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EQUBPXZIME5QYSD4","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EQUBPXZI","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:EQUBPXZIME5QYSD4EBKE3SW7QB","target":"record","payload":{"canonical_record":{"source":{"id":"1203.1084","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-06T01:47:45Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"190aac596e5bf3db6591a9f0e2dd5cfd66c1003a4675338965f826de7be3516a","abstract_canon_sha256":"40e11c645d0b73cfba69b27307e3818382bce85909f1038d480d42ef88c8b385"},"schema_version":"1.0"},"canonical_sha256":"242817df28613b0c487c20544dcadf8079851666c076f5946d54934c12fada83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:48.833716Z","signature_b64":"crM4QuOHZuQXb/okVFdlym7E6JLYA0qfAYbg4RZXJUZcNywQKuH5mGzsCyJF1LxaGMqbK2OY+FPOhfMvvtW7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"242817df28613b0c487c20544dcadf8079851666c076f5946d54934c12fada83","last_reissued_at":"2026-05-18T04:00:48.833295Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:48.833295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.1084","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-18T04:00:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SZn2NNv18yN7SW0TefbqsNqK3r1kd5rwoiBf1GDtnGSRDHvltzQ/9Kt9WVrHH3Ef4ZqTTsfBR4AMInsyHsOtDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:17:14.236441Z"},"content_sha256":"7fe4f62b0aca0ccae749b519d7bbe2489f1c6ca02791d51f89ecbe42873773de","schema_version":"1.0","event_id":"sha256:7fe4f62b0aca0ccae749b519d7bbe2489f1c6ca02791d51f89ecbe42873773de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:EQUBPXZIME5QYSD4EBKE3SW7QB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Uniquely K_r-Saturated Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Derrick Stolee, Stephen G. Hartke","submitted_at":"2012-03-06T01:47:45Z","abstract_excerpt":"A graph G is uniquely K_r-saturated if it contains no clique with r vertices and if for all edges e in the complement, G + e has a unique clique with r vertices. Previously, few examples of uniquely K_r-saturated graphs were known, and little was known about their properties. We search for these graphs by adapting orbital branching, a technique originally developed for symmetric integer linear programs. We find several new uniquely K_r-saturated graphs with 4 \\leq r \\leq 7, as well as two new infinite families based on Cayley graphs for Z_n with a small number of generators."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1084","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-18T04:00:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HocS+IRvZ4rqvWUwlIJ+vHWf0/ErkYnMQO86m6nDd/cXbDNTmhQEW1eOTMS6BTZWmYRGhaAQ/0TFq/fQdb61Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:17:14.236791Z"},"content_sha256":"614c67649e7a1fac727b2c27b76feb42c990a22d12b089834e33684046c36c52","schema_version":"1.0","event_id":"sha256:614c67649e7a1fac727b2c27b76feb42c990a22d12b089834e33684046c36c52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQUBPXZIME5QYSD4EBKE3SW7QB/bundle.json","state_url":"https://pith.science/pith/EQUBPXZIME5QYSD4EBKE3SW7QB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQUBPXZIME5QYSD4EBKE3SW7QB/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-05-30T02:17:14Z","links":{"resolver":"https://pith.science/pith/EQUBPXZIME5QYSD4EBKE3SW7QB","bundle":"https://pith.science/pith/EQUBPXZIME5QYSD4EBKE3SW7QB/bundle.json","state":"https://pith.science/pith/EQUBPXZIME5QYSD4EBKE3SW7QB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQUBPXZIME5QYSD4EBKE3SW7QB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:EQUBPXZIME5QYSD4EBKE3SW7QB","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":"40e11c645d0b73cfba69b27307e3818382bce85909f1038d480d42ef88c8b385","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-06T01:47:45Z","title_canon_sha256":"190aac596e5bf3db6591a9f0e2dd5cfd66c1003a4675338965f826de7be3516a"},"schema_version":"1.0","source":{"id":"1203.1084","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1084","created_at":"2026-05-18T04:00:48Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1084v1","created_at":"2026-05-18T04:00:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1084","created_at":"2026-05-18T04:00:48Z"},{"alias_kind":"pith_short_12","alias_value":"EQUBPXZIME5Q","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EQUBPXZIME5QYSD4","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EQUBPXZI","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:614c67649e7a1fac727b2c27b76feb42c990a22d12b089834e33684046c36c52","target":"graph","created_at":"2026-05-18T04:00:48Z","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":"A graph G is uniquely K_r-saturated if it contains no clique with r vertices and if for all edges e in the complement, G + e has a unique clique with r vertices. Previously, few examples of uniquely K_r-saturated graphs were known, and little was known about their properties. We search for these graphs by adapting orbital branching, a technique originally developed for symmetric integer linear programs. We find several new uniquely K_r-saturated graphs with 4 \\leq r \\leq 7, as well as two new infinite families based on Cayley graphs for Z_n with a small number of generators.","authors_text":"Derrick Stolee, Stephen G. Hartke","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-06T01:47:45Z","title":"Uniquely K_r-Saturated Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1084","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:7fe4f62b0aca0ccae749b519d7bbe2489f1c6ca02791d51f89ecbe42873773de","target":"record","created_at":"2026-05-18T04:00:48Z","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":"40e11c645d0b73cfba69b27307e3818382bce85909f1038d480d42ef88c8b385","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-06T01:47:45Z","title_canon_sha256":"190aac596e5bf3db6591a9f0e2dd5cfd66c1003a4675338965f826de7be3516a"},"schema_version":"1.0","source":{"id":"1203.1084","kind":"arxiv","version":1}},"canonical_sha256":"242817df28613b0c487c20544dcadf8079851666c076f5946d54934c12fada83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"242817df28613b0c487c20544dcadf8079851666c076f5946d54934c12fada83","first_computed_at":"2026-05-18T04:00:48.833295Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:48.833295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"crM4QuOHZuQXb/okVFdlym7E6JLYA0qfAYbg4RZXJUZcNywQKuH5mGzsCyJF1LxaGMqbK2OY+FPOhfMvvtW7CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:48.833716Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.1084","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fe4f62b0aca0ccae749b519d7bbe2489f1c6ca02791d51f89ecbe42873773de","sha256:614c67649e7a1fac727b2c27b76feb42c990a22d12b089834e33684046c36c52"],"state_sha256":"6a44e1bef1a50e99eeeebb98741b92de913dba1e3dd4129493837ec457332f72"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GqGN5zmxNrpo4mA8IB+DNmlogWYzEIfEcwrYgTra0LzKRU6op6QYO9cMSS9HmWZyvXoCsd1KkSSt5iBDjCVjAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:17:14.238885Z","bundle_sha256":"125bd283b83da995b0885175b9d52778674fdc3575bfeed08dc8d4965d062fb4"}}