{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:M7SEBEQKLKDJRCE6RRL5F25RQP","short_pith_number":"pith:M7SEBEQK","canonical_record":{"source":{"id":"1810.06984","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-16T13:30:51Z","cross_cats_sorted":[],"title_canon_sha256":"b12b9e06d1f9166db0c4a9fd93a44b72052bd7cc4e91e7c593c3464794ab20d6","abstract_canon_sha256":"84ff2e79bfbd6c5453e0fafb093391701fc5c351b83fdc72bcd15802e246e31f"},"schema_version":"1.0"},"canonical_sha256":"67e440920a5a8698889e8c57d2ebb183cd14b58302db32167379a905d47c5ea2","source":{"kind":"arxiv","id":"1810.06984","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06984","created_at":"2026-05-18T00:03:10Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06984v1","created_at":"2026-05-18T00:03:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06984","created_at":"2026-05-18T00:03:10Z"},{"alias_kind":"pith_short_12","alias_value":"M7SEBEQKLKDJ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"M7SEBEQKLKDJRCE6","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"M7SEBEQK","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:M7SEBEQKLKDJRCE6RRL5F25RQP","target":"record","payload":{"canonical_record":{"source":{"id":"1810.06984","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-16T13:30:51Z","cross_cats_sorted":[],"title_canon_sha256":"b12b9e06d1f9166db0c4a9fd93a44b72052bd7cc4e91e7c593c3464794ab20d6","abstract_canon_sha256":"84ff2e79bfbd6c5453e0fafb093391701fc5c351b83fdc72bcd15802e246e31f"},"schema_version":"1.0"},"canonical_sha256":"67e440920a5a8698889e8c57d2ebb183cd14b58302db32167379a905d47c5ea2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:10.840648Z","signature_b64":"dK4aKp613TVL+pbroOUP18U2+2BcSTkInoSxz6wMCzAoKAPDgiyuSf2aJnatuFkqsqOE11G4+ni4SC+SNccEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67e440920a5a8698889e8c57d2ebb183cd14b58302db32167379a905d47c5ea2","last_reissued_at":"2026-05-18T00:03:10.839962Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:10.839962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.06984","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:03:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g6Y3mMYnPiiE7m4WaS/MEuEEXd6TU80f/Nkk948OJJP940CKa4vjQqOBc7UCGg87a/O25AxzErzhCjSOTHbABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:35:56.291858Z"},"content_sha256":"6ba1b19a287778cd5e5cfe4fa832868c5e0b69c9d5262e03e3367e886fd614d1","schema_version":"1.0","event_id":"sha256:6ba1b19a287778cd5e5cfe4fa832868c5e0b69c9d5262e03e3367e886fd614d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:M7SEBEQKLKDJRCE6RRL5F25RQP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Anti-$k$-labeling of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lin Chen, Rong-Hua Li, Shurong Zhang, Weihua Yang, Xiaxia Guan","submitted_at":"2018-10-16T13:30:51Z","abstract_excerpt":"It is well known that the labeling problems of graphs arise in many (but not limited to) networking and telecommunication contexts. In this paper we introduce the anti-$k$-labeling problem of graphs which we seek to minimize the similarity (or distance) of neighboring nodes. For example, in the fundamental frequency assignment problem in wireless networks where each node is assigned a frequency, it is usually desirable to limit or minimize the frequency gap between neighboring nodes so as to limit interference.\n  Let $k\\geq1$ be an integer and $\\psi$ is a labeling function (anti-$k$-labeling) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06984","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:03:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lVP7imWpQ4Hm3Dm12cmWSxf+AiDnFyOF7N5e91WgZXCPf/WPeIsG3dNOoPikgTGlaYt235WDzEoY6DmB6NoAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:35:56.292199Z"},"content_sha256":"5f0b9f651753e78c667c1e5de7996ea97a5719aa6580609c8045973925fce1e8","schema_version":"1.0","event_id":"sha256:5f0b9f651753e78c667c1e5de7996ea97a5719aa6580609c8045973925fce1e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M7SEBEQKLKDJRCE6RRL5F25RQP/bundle.json","state_url":"https://pith.science/pith/M7SEBEQKLKDJRCE6RRL5F25RQP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M7SEBEQKLKDJRCE6RRL5F25RQP/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-01T07:35:56Z","links":{"resolver":"https://pith.science/pith/M7SEBEQKLKDJRCE6RRL5F25RQP","bundle":"https://pith.science/pith/M7SEBEQKLKDJRCE6RRL5F25RQP/bundle.json","state":"https://pith.science/pith/M7SEBEQKLKDJRCE6RRL5F25RQP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M7SEBEQKLKDJRCE6RRL5F25RQP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:M7SEBEQKLKDJRCE6RRL5F25RQP","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":"84ff2e79bfbd6c5453e0fafb093391701fc5c351b83fdc72bcd15802e246e31f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-16T13:30:51Z","title_canon_sha256":"b12b9e06d1f9166db0c4a9fd93a44b72052bd7cc4e91e7c593c3464794ab20d6"},"schema_version":"1.0","source":{"id":"1810.06984","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06984","created_at":"2026-05-18T00:03:10Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06984v1","created_at":"2026-05-18T00:03:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06984","created_at":"2026-05-18T00:03:10Z"},{"alias_kind":"pith_short_12","alias_value":"M7SEBEQKLKDJ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"M7SEBEQKLKDJRCE6","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"M7SEBEQK","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:5f0b9f651753e78c667c1e5de7996ea97a5719aa6580609c8045973925fce1e8","target":"graph","created_at":"2026-05-18T00:03:10Z","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":"It is well known that the labeling problems of graphs arise in many (but not limited to) networking and telecommunication contexts. In this paper we introduce the anti-$k$-labeling problem of graphs which we seek to minimize the similarity (or distance) of neighboring nodes. For example, in the fundamental frequency assignment problem in wireless networks where each node is assigned a frequency, it is usually desirable to limit or minimize the frequency gap between neighboring nodes so as to limit interference.\n  Let $k\\geq1$ be an integer and $\\psi$ is a labeling function (anti-$k$-labeling) ","authors_text":"Lin Chen, Rong-Hua Li, Shurong Zhang, Weihua Yang, Xiaxia Guan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-16T13:30:51Z","title":"Anti-$k$-labeling of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06984","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:6ba1b19a287778cd5e5cfe4fa832868c5e0b69c9d5262e03e3367e886fd614d1","target":"record","created_at":"2026-05-18T00:03:10Z","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":"84ff2e79bfbd6c5453e0fafb093391701fc5c351b83fdc72bcd15802e246e31f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-16T13:30:51Z","title_canon_sha256":"b12b9e06d1f9166db0c4a9fd93a44b72052bd7cc4e91e7c593c3464794ab20d6"},"schema_version":"1.0","source":{"id":"1810.06984","kind":"arxiv","version":1}},"canonical_sha256":"67e440920a5a8698889e8c57d2ebb183cd14b58302db32167379a905d47c5ea2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67e440920a5a8698889e8c57d2ebb183cd14b58302db32167379a905d47c5ea2","first_computed_at":"2026-05-18T00:03:10.839962Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:10.839962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dK4aKp613TVL+pbroOUP18U2+2BcSTkInoSxz6wMCzAoKAPDgiyuSf2aJnatuFkqsqOE11G4+ni4SC+SNccEAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:10.840648Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.06984","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ba1b19a287778cd5e5cfe4fa832868c5e0b69c9d5262e03e3367e886fd614d1","sha256:5f0b9f651753e78c667c1e5de7996ea97a5719aa6580609c8045973925fce1e8"],"state_sha256":"252a163520a7eadeacac8a88fc453027df11d7f26901b92047e13859d81e72e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HNJMPL5vj05+CD3taf+QZ/vBNM75Y/UJ9fnGOQacr3ECP9ikbE+BHzolJhrQlbh2E0hWF6PtPzECz+0RAK2oAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T07:35:56.294150Z","bundle_sha256":"7b098c5439718f9dfd0ffeac905bc31fa44607b64fc70e74dcf5760796e37eb0"}}