{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:CXLQQGH77ACMKMDUGCGAWOIOC4","short_pith_number":"pith:CXLQQGH7","schema_version":"1.0","canonical_sha256":"15d70818fff804c53074308c0b390e1726156c990c3c24b8e6a765891e571242","source":{"kind":"arxiv","id":"1111.3252","version":1},"attestation_state":"computed","paper":{"title":"Hypergraphs for computing determining sets of Kneser graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Gonz\\'alez, A. M\\'arquez, D. Garijo, J. C\\'aceres, M. L. Puertas","submitted_at":"2011-11-14T15:46:38Z","abstract_excerpt":"A set of vertices $S$ is a \\emph{determining set} of a graph $G$ if every automorphism of $G$ is uniquely determined by its action on $S$. The \\emph{determining number} of $G$ is the minimum cardinality of a determining set of $G$. This paper studies determining sets of Kneser graphs from a hypergraph perspective. This new technique lets us compute the determining number of a wide range of Kneser graphs, concretely $K_{n:k}$ with $n\\geq \\frac{k(k+1)}{2}+1$. We also show its usefulness by giving shorter proofs of the characterization of all Kneser graphs with fixed determining number 2, 3 or 4,"},"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":"1111.3252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-14T15:46:38Z","cross_cats_sorted":[],"title_canon_sha256":"b562ea6a4370424ef57e5b8041730c2a22e317ea9f28dd64073a5e71b35f87bc","abstract_canon_sha256":"c4c1b7c5b6a013489cfe902d517a379e1b1b29af6b8321fa5e255200872e7f34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:22.703445Z","signature_b64":"dDujA7tRyNFklchYUZFdGbpdQE2KRg8I6ibMcmH8cXSMu7akQb07MAqZD7ksyw4cC31ZQa1TOTGQXTi6JgpkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15d70818fff804c53074308c0b390e1726156c990c3c24b8e6a765891e571242","last_reissued_at":"2026-05-18T04:08:22.703000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:22.703000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraphs for computing determining sets of Kneser graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Gonz\\'alez, A. M\\'arquez, D. Garijo, J. C\\'aceres, M. L. Puertas","submitted_at":"2011-11-14T15:46:38Z","abstract_excerpt":"A set of vertices $S$ is a \\emph{determining set} of a graph $G$ if every automorphism of $G$ is uniquely determined by its action on $S$. The \\emph{determining number} of $G$ is the minimum cardinality of a determining set of $G$. This paper studies determining sets of Kneser graphs from a hypergraph perspective. This new technique lets us compute the determining number of a wide range of Kneser graphs, concretely $K_{n:k}$ with $n\\geq \\frac{k(k+1)}{2}+1$. We also show its usefulness by giving shorter proofs of the characterization of all Kneser graphs with fixed determining number 2, 3 or 4,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3252","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":"1111.3252","created_at":"2026-05-18T04:08:22.703063+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.3252v1","created_at":"2026-05-18T04:08:22.703063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3252","created_at":"2026-05-18T04:08:22.703063+00:00"},{"alias_kind":"pith_short_12","alias_value":"CXLQQGH77ACM","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"CXLQQGH77ACMKMDU","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"CXLQQGH7","created_at":"2026-05-18T12:26:26.731475+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/CXLQQGH77ACMKMDUGCGAWOIOC4","json":"https://pith.science/pith/CXLQQGH77ACMKMDUGCGAWOIOC4.json","graph_json":"https://pith.science/api/pith-number/CXLQQGH77ACMKMDUGCGAWOIOC4/graph.json","events_json":"https://pith.science/api/pith-number/CXLQQGH77ACMKMDUGCGAWOIOC4/events.json","paper":"https://pith.science/paper/CXLQQGH7"},"agent_actions":{"view_html":"https://pith.science/pith/CXLQQGH77ACMKMDUGCGAWOIOC4","download_json":"https://pith.science/pith/CXLQQGH77ACMKMDUGCGAWOIOC4.json","view_paper":"https://pith.science/paper/CXLQQGH7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.3252&json=true","fetch_graph":"https://pith.science/api/pith-number/CXLQQGH77ACMKMDUGCGAWOIOC4/graph.json","fetch_events":"https://pith.science/api/pith-number/CXLQQGH77ACMKMDUGCGAWOIOC4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CXLQQGH77ACMKMDUGCGAWOIOC4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CXLQQGH77ACMKMDUGCGAWOIOC4/action/storage_attestation","attest_author":"https://pith.science/pith/CXLQQGH77ACMKMDUGCGAWOIOC4/action/author_attestation","sign_citation":"https://pith.science/pith/CXLQQGH77ACMKMDUGCGAWOIOC4/action/citation_signature","submit_replication":"https://pith.science/pith/CXLQQGH77ACMKMDUGCGAWOIOC4/action/replication_record"}},"created_at":"2026-05-18T04:08:22.703063+00:00","updated_at":"2026-05-18T04:08:22.703063+00:00"}