{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:EQUBPXZIME5QYSD4EBKE3SW7QB","short_pith_number":"pith:EQUBPXZI","schema_version":"1.0","canonical_sha256":"242817df28613b0c487c20544dcadf8079851666c076f5946d54934c12fada83","source":{"kind":"arxiv","id":"1203.1084","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1203.1084","created_at":"2026-05-18T04:00:48.833357+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.1084v1","created_at":"2026-05-18T04:00:48.833357+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1084","created_at":"2026-05-18T04:00:48.833357+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQUBPXZIME5Q","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQUBPXZIME5QYSD4","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQUBPXZI","created_at":"2026-05-18T12:27:04.183437+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/EQUBPXZIME5QYSD4EBKE3SW7QB","json":"https://pith.science/pith/EQUBPXZIME5QYSD4EBKE3SW7QB.json","graph_json":"https://pith.science/api/pith-number/EQUBPXZIME5QYSD4EBKE3SW7QB/graph.json","events_json":"https://pith.science/api/pith-number/EQUBPXZIME5QYSD4EBKE3SW7QB/events.json","paper":"https://pith.science/paper/EQUBPXZI"},"agent_actions":{"view_html":"https://pith.science/pith/EQUBPXZIME5QYSD4EBKE3SW7QB","download_json":"https://pith.science/pith/EQUBPXZIME5QYSD4EBKE3SW7QB.json","view_paper":"https://pith.science/paper/EQUBPXZI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.1084&json=true","fetch_graph":"https://pith.science/api/pith-number/EQUBPXZIME5QYSD4EBKE3SW7QB/graph.json","fetch_events":"https://pith.science/api/pith-number/EQUBPXZIME5QYSD4EBKE3SW7QB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQUBPXZIME5QYSD4EBKE3SW7QB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQUBPXZIME5QYSD4EBKE3SW7QB/action/storage_attestation","attest_author":"https://pith.science/pith/EQUBPXZIME5QYSD4EBKE3SW7QB/action/author_attestation","sign_citation":"https://pith.science/pith/EQUBPXZIME5QYSD4EBKE3SW7QB/action/citation_signature","submit_replication":"https://pith.science/pith/EQUBPXZIME5QYSD4EBKE3SW7QB/action/replication_record"}},"created_at":"2026-05-18T04:00:48.833357+00:00","updated_at":"2026-05-18T04:00:48.833357+00:00"}