{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:DGACGIUYU3XPFITWTIRZD75N66","short_pith_number":"pith:DGACGIUY","schema_version":"1.0","canonical_sha256":"1980232298a6eef2a2769a2391ffadf787b1188baeacb4cd25a9d757381f2407","source":{"kind":"arxiv","id":"1008.1608","version":1},"attestation_state":"computed","paper":{"title":"Universal Cycles for Minimum Coverings of Pairs by Triples, with Application to 2-Radius Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"San Ling, Xiande Zhang, Yeow Meng Chee, Yin Tan","submitted_at":"2010-08-10T00:49:08Z","abstract_excerpt":"A new ordering, extending the notion of universal cycles of Chung {\\em et al.} (1992), is proposed for the blocks of $k$-uniform set systems. Existence of minimum coverings of pairs by triples that possess such an ordering is established for all orders. Application to the construction of short 2-radius sequences is given, with some new 2-radius sequences found through computer search."},"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":"1008.1608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-10T00:49:08Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e80bd95cdcc864852110e47e98a76a3bad7564e4ce33f25a11bfd6702e1c3d8f","abstract_canon_sha256":"e1b4ab4afbef0b549bd6908e8c20a7f9bced89b15b9d33ed9de129c90bb848b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:23.721637Z","signature_b64":"Aul3z2RQGBahJ/BhveXf8btQGWHTPLIi2P6Fx7IQwi9HkxY/ySGQCiZDBkK2E3Am7cBOLlgjjKl1OOJ3OCzQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1980232298a6eef2a2769a2391ffadf787b1188baeacb4cd25a9d757381f2407","last_reissued_at":"2026-05-18T04:42:23.721056Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:23.721056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Cycles for Minimum Coverings of Pairs by Triples, with Application to 2-Radius Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"San Ling, Xiande Zhang, Yeow Meng Chee, Yin Tan","submitted_at":"2010-08-10T00:49:08Z","abstract_excerpt":"A new ordering, extending the notion of universal cycles of Chung {\\em et al.} (1992), is proposed for the blocks of $k$-uniform set systems. Existence of minimum coverings of pairs by triples that possess such an ordering is established for all orders. Application to the construction of short 2-radius sequences is given, with some new 2-radius sequences found through computer search."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1608","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":"1008.1608","created_at":"2026-05-18T04:42:23.721147+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.1608v1","created_at":"2026-05-18T04:42:23.721147+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1608","created_at":"2026-05-18T04:42:23.721147+00:00"},{"alias_kind":"pith_short_12","alias_value":"DGACGIUYU3XP","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"DGACGIUYU3XPFITW","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"DGACGIUY","created_at":"2026-05-18T12:26:06.534383+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/DGACGIUYU3XPFITWTIRZD75N66","json":"https://pith.science/pith/DGACGIUYU3XPFITWTIRZD75N66.json","graph_json":"https://pith.science/api/pith-number/DGACGIUYU3XPFITWTIRZD75N66/graph.json","events_json":"https://pith.science/api/pith-number/DGACGIUYU3XPFITWTIRZD75N66/events.json","paper":"https://pith.science/paper/DGACGIUY"},"agent_actions":{"view_html":"https://pith.science/pith/DGACGIUYU3XPFITWTIRZD75N66","download_json":"https://pith.science/pith/DGACGIUYU3XPFITWTIRZD75N66.json","view_paper":"https://pith.science/paper/DGACGIUY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.1608&json=true","fetch_graph":"https://pith.science/api/pith-number/DGACGIUYU3XPFITWTIRZD75N66/graph.json","fetch_events":"https://pith.science/api/pith-number/DGACGIUYU3XPFITWTIRZD75N66/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DGACGIUYU3XPFITWTIRZD75N66/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DGACGIUYU3XPFITWTIRZD75N66/action/storage_attestation","attest_author":"https://pith.science/pith/DGACGIUYU3XPFITWTIRZD75N66/action/author_attestation","sign_citation":"https://pith.science/pith/DGACGIUYU3XPFITWTIRZD75N66/action/citation_signature","submit_replication":"https://pith.science/pith/DGACGIUYU3XPFITWTIRZD75N66/action/replication_record"}},"created_at":"2026-05-18T04:42:23.721147+00:00","updated_at":"2026-05-18T04:42:23.721147+00:00"}