{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:CXLQQGH77ACMKMDUGCGAWOIOC4","short_pith_number":"pith:CXLQQGH7","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"},"canonical_sha256":"15d70818fff804c53074308c0b390e1726156c990c3c24b8e6a765891e571242","source":{"kind":"arxiv","id":"1111.3252","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3252","created_at":"2026-05-18T04:08:22Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3252v1","created_at":"2026-05-18T04:08:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3252","created_at":"2026-05-18T04:08:22Z"},{"alias_kind":"pith_short_12","alias_value":"CXLQQGH77ACM","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CXLQQGH77ACMKMDU","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CXLQQGH7","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:CXLQQGH77ACMKMDUGCGAWOIOC4","target":"record","payload":{"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"},"canonical_sha256":"15d70818fff804c53074308c0b390e1726156c990c3c24b8e6a765891e571242","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"},"source_kind":"arxiv","source_id":"1111.3252","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:08:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FoF6tHM0vic82u+8PCtT1LyPYO6B0QNIJpMxCX3nPRLgpaLTtXmVCLc9TQhABz4g/4FZRtyDvfvJnzaD0DL2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:22:52.958386Z"},"content_sha256":"d241756747aaf86366cd7d7ce358a9268715004e57a4b176a23c63ced1dfd58e","schema_version":"1.0","event_id":"sha256:d241756747aaf86366cd7d7ce358a9268715004e57a4b176a23c63ced1dfd58e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:CXLQQGH77ACMKMDUGCGAWOIOC4","target":"graph","payload":{"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"},"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:08:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lPVfQ8/E3zh0tVu6POgx/H6J27ClOkh6ZADRAjSdNoqauDqfPO11AEMmyle/JKAQkkgWCgrLj/rOmf7ID8yPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:22:52.958737Z"},"content_sha256":"89fd69b5e2bd425e4501239902ffb3bff143ac630ffec1f1cef427bf0ad81d7e","schema_version":"1.0","event_id":"sha256:89fd69b5e2bd425e4501239902ffb3bff143ac630ffec1f1cef427bf0ad81d7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CXLQQGH77ACMKMDUGCGAWOIOC4/bundle.json","state_url":"https://pith.science/pith/CXLQQGH77ACMKMDUGCGAWOIOC4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CXLQQGH77ACMKMDUGCGAWOIOC4/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-31T23:22:52Z","links":{"resolver":"https://pith.science/pith/CXLQQGH77ACMKMDUGCGAWOIOC4","bundle":"https://pith.science/pith/CXLQQGH77ACMKMDUGCGAWOIOC4/bundle.json","state":"https://pith.science/pith/CXLQQGH77ACMKMDUGCGAWOIOC4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CXLQQGH77ACMKMDUGCGAWOIOC4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:CXLQQGH77ACMKMDUGCGAWOIOC4","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":"c4c1b7c5b6a013489cfe902d517a379e1b1b29af6b8321fa5e255200872e7f34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-14T15:46:38Z","title_canon_sha256":"b562ea6a4370424ef57e5b8041730c2a22e317ea9f28dd64073a5e71b35f87bc"},"schema_version":"1.0","source":{"id":"1111.3252","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3252","created_at":"2026-05-18T04:08:22Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3252v1","created_at":"2026-05-18T04:08:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3252","created_at":"2026-05-18T04:08:22Z"},{"alias_kind":"pith_short_12","alias_value":"CXLQQGH77ACM","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CXLQQGH77ACMKMDU","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CXLQQGH7","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:89fd69b5e2bd425e4501239902ffb3bff143ac630ffec1f1cef427bf0ad81d7e","target":"graph","created_at":"2026-05-18T04:08:22Z","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 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,","authors_text":"A. Gonz\\'alez, A. M\\'arquez, D. Garijo, J. C\\'aceres, M. L. Puertas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-14T15:46:38Z","title":"Hypergraphs for computing determining sets of Kneser graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3252","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:d241756747aaf86366cd7d7ce358a9268715004e57a4b176a23c63ced1dfd58e","target":"record","created_at":"2026-05-18T04:08:22Z","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":"c4c1b7c5b6a013489cfe902d517a379e1b1b29af6b8321fa5e255200872e7f34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-14T15:46:38Z","title_canon_sha256":"b562ea6a4370424ef57e5b8041730c2a22e317ea9f28dd64073a5e71b35f87bc"},"schema_version":"1.0","source":{"id":"1111.3252","kind":"arxiv","version":1}},"canonical_sha256":"15d70818fff804c53074308c0b390e1726156c990c3c24b8e6a765891e571242","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15d70818fff804c53074308c0b390e1726156c990c3c24b8e6a765891e571242","first_computed_at":"2026-05-18T04:08:22.703000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:22.703000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dDujA7tRyNFklchYUZFdGbpdQE2KRg8I6ibMcmH8cXSMu7akQb07MAqZD7ksyw4cC31ZQa1TOTGQXTi6JgpkDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:22.703445Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.3252","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d241756747aaf86366cd7d7ce358a9268715004e57a4b176a23c63ced1dfd58e","sha256:89fd69b5e2bd425e4501239902ffb3bff143ac630ffec1f1cef427bf0ad81d7e"],"state_sha256":"b21547164c7c6402f706cd4a60a00f57796a152a886bc7dd18289be5b9ea51c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x9HeEtFKpG7lOiHLlkF5q8mx5+lQjBSIvl1AHh/NZTx4KpDqFyVgNamBImsnmOlgt14FhulqNE8Rq5QcBglPCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:22:52.960789Z","bundle_sha256":"193d828105145f8af330a97f7677de66b7d4a9f025411c13298e5fc5262e9eef"}}