{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HN5CUBRH4UJ5OUTLGL3DUHHLOJ","short_pith_number":"pith:HN5CUBRH","canonical_record":{"source":{"id":"1703.08652","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-25T06:00:44Z","cross_cats_sorted":[],"title_canon_sha256":"abf86a3b6abc5685394a6a92a4ea1b1b58b376414e35785e4e23edb2216e972a","abstract_canon_sha256":"3303a8932f0df635974d17ed4efc17495b2232184e6e5402af13ee6f6898deef"},"schema_version":"1.0"},"canonical_sha256":"3b7a2a0627e513d7526b32f63a1ceb727dbf1bd65d967a31ec47b172e2d74289","source":{"kind":"arxiv","id":"1703.08652","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08652","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08652v1","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08652","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"pith_short_12","alias_value":"HN5CUBRH4UJ5","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HN5CUBRH4UJ5OUTL","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HN5CUBRH","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HN5CUBRH4UJ5OUTLGL3DUHHLOJ","target":"record","payload":{"canonical_record":{"source":{"id":"1703.08652","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-25T06:00:44Z","cross_cats_sorted":[],"title_canon_sha256":"abf86a3b6abc5685394a6a92a4ea1b1b58b376414e35785e4e23edb2216e972a","abstract_canon_sha256":"3303a8932f0df635974d17ed4efc17495b2232184e6e5402af13ee6f6898deef"},"schema_version":"1.0"},"canonical_sha256":"3b7a2a0627e513d7526b32f63a1ceb727dbf1bd65d967a31ec47b172e2d74289","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:55.970697Z","signature_b64":"Li2+ZXAPa7OGfSdA6Yk+HKagnq5MiEHfLMQikkq2btnOv/sthqZLHfHn5FfKZ+hZSILOAx4va6cHxQtIx+MpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b7a2a0627e513d7526b32f63a1ceb727dbf1bd65d967a31ec47b172e2d74289","last_reissued_at":"2026-05-18T00:47:55.970114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:55.970114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.08652","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-18T00:47:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IZWti9U2kXa8f8X4PwWfcVmiDYsTjKnjkiVR7I4twCNvMv6AFlV+QN/eFYC+fTH9SKs1lzqsHFuuxLGRHD4yDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:38:00.181604Z"},"content_sha256":"49684cbaa6fa4d4a2ba443f12c1ed1f2f17d2f2ffa025ef20e968af17d35412a","schema_version":"1.0","event_id":"sha256:49684cbaa6fa4d4a2ba443f12c1ed1f2f17d2f2ffa025ef20e968af17d35412a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HN5CUBRH4UJ5OUTLGL3DUHHLOJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Perfect codes in circulant graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"He Huang, Rongquan Feng, Sanming Zhou","submitted_at":"2017-03-25T06:00:44Z","abstract_excerpt":"A perfect code in a graph $\\Gamma = (V, E)$ is a subset $C$ of $V$ that is an independent set such that every vertex in $V \\setminus C$ is adjacent to exactly one vertex in $C$. A total perfect code in $\\Gamma$ is a subset $C$ of $V$ such that every vertex of $V$ is adjacent to exactly one vertex in $C$. A perfect code in the Hamming graph $H(n, q)$ agrees with a $q$-ary perfect 1-code of length $n$ in the classical setting. In this paper we give a necessary and sufficient condition for a circulant graph of degree $p-1$ to admit a perfect code, where $p$ is an odd prime. We also obtain a neces"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08652","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-18T00:47:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T1X37g8OHUsAS2a3dxCPw9hK+TpUNSivZNyQpO/8ZjxSELF2JHmzx+YoFy7UJgFtD6b+MoYHDA98fhsbm9lkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:38:00.182268Z"},"content_sha256":"d6bd200bc05767c9fe46ee85c2cb961ef32df98ea7860e00e25f4e5c16cbf8c8","schema_version":"1.0","event_id":"sha256:d6bd200bc05767c9fe46ee85c2cb961ef32df98ea7860e00e25f4e5c16cbf8c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HN5CUBRH4UJ5OUTLGL3DUHHLOJ/bundle.json","state_url":"https://pith.science/pith/HN5CUBRH4UJ5OUTLGL3DUHHLOJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HN5CUBRH4UJ5OUTLGL3DUHHLOJ/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-07T15:38:00Z","links":{"resolver":"https://pith.science/pith/HN5CUBRH4UJ5OUTLGL3DUHHLOJ","bundle":"https://pith.science/pith/HN5CUBRH4UJ5OUTLGL3DUHHLOJ/bundle.json","state":"https://pith.science/pith/HN5CUBRH4UJ5OUTLGL3DUHHLOJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HN5CUBRH4UJ5OUTLGL3DUHHLOJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HN5CUBRH4UJ5OUTLGL3DUHHLOJ","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":"3303a8932f0df635974d17ed4efc17495b2232184e6e5402af13ee6f6898deef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-25T06:00:44Z","title_canon_sha256":"abf86a3b6abc5685394a6a92a4ea1b1b58b376414e35785e4e23edb2216e972a"},"schema_version":"1.0","source":{"id":"1703.08652","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08652","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08652v1","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08652","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"pith_short_12","alias_value":"HN5CUBRH4UJ5","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HN5CUBRH4UJ5OUTL","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HN5CUBRH","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:d6bd200bc05767c9fe46ee85c2cb961ef32df98ea7860e00e25f4e5c16cbf8c8","target":"graph","created_at":"2026-05-18T00:47:55Z","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 perfect code in a graph $\\Gamma = (V, E)$ is a subset $C$ of $V$ that is an independent set such that every vertex in $V \\setminus C$ is adjacent to exactly one vertex in $C$. A total perfect code in $\\Gamma$ is a subset $C$ of $V$ such that every vertex of $V$ is adjacent to exactly one vertex in $C$. A perfect code in the Hamming graph $H(n, q)$ agrees with a $q$-ary perfect 1-code of length $n$ in the classical setting. In this paper we give a necessary and sufficient condition for a circulant graph of degree $p-1$ to admit a perfect code, where $p$ is an odd prime. We also obtain a neces","authors_text":"He Huang, Rongquan Feng, Sanming Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-25T06:00:44Z","title":"Perfect codes in circulant graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08652","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:49684cbaa6fa4d4a2ba443f12c1ed1f2f17d2f2ffa025ef20e968af17d35412a","target":"record","created_at":"2026-05-18T00:47:55Z","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":"3303a8932f0df635974d17ed4efc17495b2232184e6e5402af13ee6f6898deef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-25T06:00:44Z","title_canon_sha256":"abf86a3b6abc5685394a6a92a4ea1b1b58b376414e35785e4e23edb2216e972a"},"schema_version":"1.0","source":{"id":"1703.08652","kind":"arxiv","version":1}},"canonical_sha256":"3b7a2a0627e513d7526b32f63a1ceb727dbf1bd65d967a31ec47b172e2d74289","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b7a2a0627e513d7526b32f63a1ceb727dbf1bd65d967a31ec47b172e2d74289","first_computed_at":"2026-05-18T00:47:55.970114Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:55.970114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Li2+ZXAPa7OGfSdA6Yk+HKagnq5MiEHfLMQikkq2btnOv/sthqZLHfHn5FfKZ+hZSILOAx4va6cHxQtIx+MpAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:55.970697Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.08652","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49684cbaa6fa4d4a2ba443f12c1ed1f2f17d2f2ffa025ef20e968af17d35412a","sha256:d6bd200bc05767c9fe46ee85c2cb961ef32df98ea7860e00e25f4e5c16cbf8c8"],"state_sha256":"92a06df773f516b13f88d4fe6cc4f2bd811d3f066b07cb1e1721788906ba02f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bfK8potHj0Lv+t8dHz8lHKWD2X5TuauU6/Wb/hdcvHuiYZrlsuQ87S5fzB/B7P1qia9U5rptSyl/LuyAr+QXAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T15:38:00.185866Z","bundle_sha256":"967e0986043adbd36d938016852885d85e672a34c5bc52bf56f5cd5f9d9c9533"}}