{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:66QBJMVNRUBJLGFJTE5DZYWZDH","short_pith_number":"pith:66QBJMVN","canonical_record":{"source":{"id":"1211.5326","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-22T16:19:22Z","cross_cats_sorted":[],"title_canon_sha256":"865a355bb3f0648d1863551255214ba2e9a24aeb3a0e76b7eaf904443cda1dff","abstract_canon_sha256":"740c3710ebe9b80b9549cddca811c9ac57ea04009226ddcff2b0953fb9f2e11e"},"schema_version":"1.0"},"canonical_sha256":"f7a014b2ad8d029598a9993a3ce2d919cb04269a3d770aae16d731ea9e1f43c9","source":{"kind":"arxiv","id":"1211.5326","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5326","created_at":"2026-05-18T00:17:27Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5326v2","created_at":"2026-05-18T00:17:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5326","created_at":"2026-05-18T00:17:27Z"},{"alias_kind":"pith_short_12","alias_value":"66QBJMVNRUBJ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"66QBJMVNRUBJLGFJ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"66QBJMVN","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:66QBJMVNRUBJLGFJTE5DZYWZDH","target":"record","payload":{"canonical_record":{"source":{"id":"1211.5326","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-22T16:19:22Z","cross_cats_sorted":[],"title_canon_sha256":"865a355bb3f0648d1863551255214ba2e9a24aeb3a0e76b7eaf904443cda1dff","abstract_canon_sha256":"740c3710ebe9b80b9549cddca811c9ac57ea04009226ddcff2b0953fb9f2e11e"},"schema_version":"1.0"},"canonical_sha256":"f7a014b2ad8d029598a9993a3ce2d919cb04269a3d770aae16d731ea9e1f43c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:27.429495Z","signature_b64":"NBSjv7ApJVIm85BnVjwaBQgooxz/x3jc09F8u6mwWxERFwsHEGsCBayt4RucArP2SRpd082qWLRxjRk7LMMCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7a014b2ad8d029598a9993a3ce2d919cb04269a3d770aae16d731ea9e1f43c9","last_reissued_at":"2026-05-18T00:17:27.428888Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:27.428888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.5326","source_version":2,"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:17:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"feJq4yzfHVJeQo3G5Xk6nOLmFJAa+uFJ/E5bnZGBOUnXJdmgMQ/r5jYWDTDDyFfKSUBHY+o8tjQCyha5OzBFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:49:40.664712Z"},"content_sha256":"817d62d8d55342876ecb7cc23ee4becda10a2856afd83b8be8288af48cc21036","schema_version":"1.0","event_id":"sha256:817d62d8d55342876ecb7cc23ee4becda10a2856afd83b8be8288af48cc21036"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:66QBJMVNRUBJLGFJTE5DZYWZDH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constant 2-labellings and an application to (r,a,b)-covering codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Elise Vandomme, Sylvain Gravier","submitted_at":"2012-11-22T16:19:22Z","abstract_excerpt":"We introduce the concept of constant $2$-labelling of a weighted graph and show how it can be used to obtain perfect weighted coverings. Roughly speaking, a constant $2$-labelling of a weighted graph is a $2$-colouring of its vertex set which preserves the sum of the weights of black vertices under some automorphisms. We study this problem on four types of weighted cycles. Our results on cycles allow us to determine $(r,a,b)$-codes in $\\mathbb{Z}^2$ whenever $|a-b|>4$, $r\\ge2$ and we give the precise values of $a$ and $b$. This is a refinement of Axenovich's theorem proved in 2003."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5326","kind":"arxiv","version":2},"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:17:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oAJHMSJYQC0FR8p93LGiWeu5yzaNnDTnrlAKbub8tIxR023hewOYuJHyhfbQ7QEV/+0X4s/Yr0c3jDb4di27Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:49:40.665407Z"},"content_sha256":"72e0c4a89da0b7ee6c1a341df73dea51e77c734406d962cc710d106ce124c44d","schema_version":"1.0","event_id":"sha256:72e0c4a89da0b7ee6c1a341df73dea51e77c734406d962cc710d106ce124c44d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/66QBJMVNRUBJLGFJTE5DZYWZDH/bundle.json","state_url":"https://pith.science/pith/66QBJMVNRUBJLGFJTE5DZYWZDH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/66QBJMVNRUBJLGFJTE5DZYWZDH/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-26T20:49:40Z","links":{"resolver":"https://pith.science/pith/66QBJMVNRUBJLGFJTE5DZYWZDH","bundle":"https://pith.science/pith/66QBJMVNRUBJLGFJTE5DZYWZDH/bundle.json","state":"https://pith.science/pith/66QBJMVNRUBJLGFJTE5DZYWZDH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/66QBJMVNRUBJLGFJTE5DZYWZDH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:66QBJMVNRUBJLGFJTE5DZYWZDH","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":"740c3710ebe9b80b9549cddca811c9ac57ea04009226ddcff2b0953fb9f2e11e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-22T16:19:22Z","title_canon_sha256":"865a355bb3f0648d1863551255214ba2e9a24aeb3a0e76b7eaf904443cda1dff"},"schema_version":"1.0","source":{"id":"1211.5326","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5326","created_at":"2026-05-18T00:17:27Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5326v2","created_at":"2026-05-18T00:17:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5326","created_at":"2026-05-18T00:17:27Z"},{"alias_kind":"pith_short_12","alias_value":"66QBJMVNRUBJ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"66QBJMVNRUBJLGFJ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"66QBJMVN","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:72e0c4a89da0b7ee6c1a341df73dea51e77c734406d962cc710d106ce124c44d","target":"graph","created_at":"2026-05-18T00:17:27Z","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":"We introduce the concept of constant $2$-labelling of a weighted graph and show how it can be used to obtain perfect weighted coverings. Roughly speaking, a constant $2$-labelling of a weighted graph is a $2$-colouring of its vertex set which preserves the sum of the weights of black vertices under some automorphisms. We study this problem on four types of weighted cycles. Our results on cycles allow us to determine $(r,a,b)$-codes in $\\mathbb{Z}^2$ whenever $|a-b|>4$, $r\\ge2$ and we give the precise values of $a$ and $b$. This is a refinement of Axenovich's theorem proved in 2003.","authors_text":"Elise Vandomme, Sylvain Gravier","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-22T16:19:22Z","title":"Constant 2-labellings and an application to (r,a,b)-covering codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5326","kind":"arxiv","version":2},"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:817d62d8d55342876ecb7cc23ee4becda10a2856afd83b8be8288af48cc21036","target":"record","created_at":"2026-05-18T00:17:27Z","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":"740c3710ebe9b80b9549cddca811c9ac57ea04009226ddcff2b0953fb9f2e11e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-22T16:19:22Z","title_canon_sha256":"865a355bb3f0648d1863551255214ba2e9a24aeb3a0e76b7eaf904443cda1dff"},"schema_version":"1.0","source":{"id":"1211.5326","kind":"arxiv","version":2}},"canonical_sha256":"f7a014b2ad8d029598a9993a3ce2d919cb04269a3d770aae16d731ea9e1f43c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7a014b2ad8d029598a9993a3ce2d919cb04269a3d770aae16d731ea9e1f43c9","first_computed_at":"2026-05-18T00:17:27.428888Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:27.428888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NBSjv7ApJVIm85BnVjwaBQgooxz/x3jc09F8u6mwWxERFwsHEGsCBayt4RucArP2SRpd082qWLRxjRk7LMMCAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:27.429495Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.5326","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:817d62d8d55342876ecb7cc23ee4becda10a2856afd83b8be8288af48cc21036","sha256:72e0c4a89da0b7ee6c1a341df73dea51e77c734406d962cc710d106ce124c44d"],"state_sha256":"5280eb3650dd842acca06b7412915cf2b5be472a2bc19e6ccc8465e3bebe87f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GPXhr7bwIqGtQ88cOueCypl1HgOPW6k+3oTBySUYM74okALit0ojLGbka+OY7cjXmQ0eEbAcggihyCbxjXkYAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:49:40.669289Z","bundle_sha256":"5d70a6890a28ff66ee4b324428e05164ff7fe6e84eacc70b1b6533e6531aecc6"}}