{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4EYLY7A4SBYUQPEUM7ILV4FVCE","short_pith_number":"pith:4EYLY7A4","schema_version":"1.0","canonical_sha256":"e130bc7c1c9071483c9467d0baf0b51116ce8f30c92f710bf27d51a152213a83","source":{"kind":"arxiv","id":"1809.09300","version":1},"attestation_state":"computed","paper":{"title":"Optimal Equi-difference Conflict-avoiding Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Derong Xie, Jinquan Luo","submitted_at":"2018-09-25T03:17:02Z","abstract_excerpt":"An equi-differece conflict-avoiding code $(CAC^{e})\\ \\mathcal{C}$ of length $n$ and weight $\\omega$ is a collection of $\\omega$-subsets (called codewords) which has the form $\\{0,i,2i,\\cdots,(\\omega-1)i\\}$ of $\\mathbb{Z}_{n}$ such that $\\Delta(c_{1})\\cap\\Delta(c_{2})=\\emptyset$ holds for any $c_{1},\\ c_{2}\\in\\mathcal{C}$, $c_{1}\\neq c_{2}$ where $\\Delta(c)=\\{j-i \\ (\\mbox{mod}\\ n) \\; | \\; i,j\\in c,i\\neq j\\}.$ A code $\\mathcal{C}\\in CAC^{e}s$ with maximum code size for given $n$ and $\\omega$ is called optimal and is said to be perfect if $\\cup_{c\\in \\mathcal{C}}\\Delta(c)=\\mathbb{Z}_{n}\\backslash"},"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":"1809.09300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-25T03:17:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"88e7a8e9dd3c18e35a12f7e7b987d2df9668a9200660e48fcf655defc0c78bce","abstract_canon_sha256":"3e40070c863fac6d4c2da0238c10a728d263163bae7ecc7c0e420986c13ca294"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:53.758699Z","signature_b64":"9QKN9SlgjHl5wPOP8HdHqhFzDpP9GlU2ugphrJJ1anJRwa57X8WYKR4WbI5N8+FJOo/1TBj2EsBDK23PlhXyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e130bc7c1c9071483c9467d0baf0b51116ce8f30c92f710bf27d51a152213a83","last_reissued_at":"2026-05-18T00:04:53.757987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:53.757987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Equi-difference Conflict-avoiding Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Derong Xie, Jinquan Luo","submitted_at":"2018-09-25T03:17:02Z","abstract_excerpt":"An equi-differece conflict-avoiding code $(CAC^{e})\\ \\mathcal{C}$ of length $n$ and weight $\\omega$ is a collection of $\\omega$-subsets (called codewords) which has the form $\\{0,i,2i,\\cdots,(\\omega-1)i\\}$ of $\\mathbb{Z}_{n}$ such that $\\Delta(c_{1})\\cap\\Delta(c_{2})=\\emptyset$ holds for any $c_{1},\\ c_{2}\\in\\mathcal{C}$, $c_{1}\\neq c_{2}$ where $\\Delta(c)=\\{j-i \\ (\\mbox{mod}\\ n) \\; | \\; i,j\\in c,i\\neq j\\}.$ A code $\\mathcal{C}\\in CAC^{e}s$ with maximum code size for given $n$ and $\\omega$ is called optimal and is said to be perfect if $\\cup_{c\\in \\mathcal{C}}\\Delta(c)=\\mathbb{Z}_{n}\\backslash"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09300","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":"1809.09300","created_at":"2026-05-18T00:04:53.758106+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.09300v1","created_at":"2026-05-18T00:04:53.758106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09300","created_at":"2026-05-18T00:04:53.758106+00:00"},{"alias_kind":"pith_short_12","alias_value":"4EYLY7A4SBYU","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4EYLY7A4SBYUQPEU","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4EYLY7A4","created_at":"2026-05-18T12:32:05.422762+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/4EYLY7A4SBYUQPEUM7ILV4FVCE","json":"https://pith.science/pith/4EYLY7A4SBYUQPEUM7ILV4FVCE.json","graph_json":"https://pith.science/api/pith-number/4EYLY7A4SBYUQPEUM7ILV4FVCE/graph.json","events_json":"https://pith.science/api/pith-number/4EYLY7A4SBYUQPEUM7ILV4FVCE/events.json","paper":"https://pith.science/paper/4EYLY7A4"},"agent_actions":{"view_html":"https://pith.science/pith/4EYLY7A4SBYUQPEUM7ILV4FVCE","download_json":"https://pith.science/pith/4EYLY7A4SBYUQPEUM7ILV4FVCE.json","view_paper":"https://pith.science/paper/4EYLY7A4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.09300&json=true","fetch_graph":"https://pith.science/api/pith-number/4EYLY7A4SBYUQPEUM7ILV4FVCE/graph.json","fetch_events":"https://pith.science/api/pith-number/4EYLY7A4SBYUQPEUM7ILV4FVCE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4EYLY7A4SBYUQPEUM7ILV4FVCE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4EYLY7A4SBYUQPEUM7ILV4FVCE/action/storage_attestation","attest_author":"https://pith.science/pith/4EYLY7A4SBYUQPEUM7ILV4FVCE/action/author_attestation","sign_citation":"https://pith.science/pith/4EYLY7A4SBYUQPEUM7ILV4FVCE/action/citation_signature","submit_replication":"https://pith.science/pith/4EYLY7A4SBYUQPEUM7ILV4FVCE/action/replication_record"}},"created_at":"2026-05-18T00:04:53.758106+00:00","updated_at":"2026-05-18T00:04:53.758106+00:00"}