{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:5V7KPAPB2P3ZWK3YEFO5R7F3IA","short_pith_number":"pith:5V7KPAPB","schema_version":"1.0","canonical_sha256":"ed7ea781e1d3f79b2b78215dd8fcbb4010b7ef97759fe391f6612ac9160eb33b","source":{"kind":"arxiv","id":"1008.4408","version":1},"attestation_state":"computed","paper":{"title":"A Pair of Disjoint 3-GDDs of type g^t u^1","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Junling Zhou, Yanxun Chang, Yeow Meng Chee","submitted_at":"2010-08-26T00:00:22Z","abstract_excerpt":"Pairwise disjoint 3-GDDs can be used to construct some optimal constant-weight codes. We study the existence of a pair of disjoint 3-GDDs of type $g^t u^1$ and establish that its necessary conditions are also sufficient."},"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.4408","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-26T00:00:22Z","cross_cats_sorted":[],"title_canon_sha256":"7fb34340171c0cb6661695971a1b95dfa73aa2659ebac9b7d19733fa99604adf","abstract_canon_sha256":"0ed956826e179a97376b87fe09faa6c453c589bfc96e2950a71567722368d281"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:45.363286Z","signature_b64":"s1ZusAeN0FCIVwfcgdthG+nIgOkC6Me1OVMaHnivd9co7D/dO9VOEGTxNz7L84hctBD8T9fzxIRb+7phBsjpCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed7ea781e1d3f79b2b78215dd8fcbb4010b7ef97759fe391f6612ac9160eb33b","last_reissued_at":"2026-05-18T04:41:45.362918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:45.362918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Pair of Disjoint 3-GDDs of type g^t u^1","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Junling Zhou, Yanxun Chang, Yeow Meng Chee","submitted_at":"2010-08-26T00:00:22Z","abstract_excerpt":"Pairwise disjoint 3-GDDs can be used to construct some optimal constant-weight codes. We study the existence of a pair of disjoint 3-GDDs of type $g^t u^1$ and establish that its necessary conditions are also sufficient."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4408","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.4408","created_at":"2026-05-18T04:41:45.362979+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.4408v1","created_at":"2026-05-18T04:41:45.362979+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4408","created_at":"2026-05-18T04:41:45.362979+00:00"},{"alias_kind":"pith_short_12","alias_value":"5V7KPAPB2P3Z","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"5V7KPAPB2P3ZWK3Y","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"5V7KPAPB","created_at":"2026-05-18T12:26:04.259169+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/5V7KPAPB2P3ZWK3YEFO5R7F3IA","json":"https://pith.science/pith/5V7KPAPB2P3ZWK3YEFO5R7F3IA.json","graph_json":"https://pith.science/api/pith-number/5V7KPAPB2P3ZWK3YEFO5R7F3IA/graph.json","events_json":"https://pith.science/api/pith-number/5V7KPAPB2P3ZWK3YEFO5R7F3IA/events.json","paper":"https://pith.science/paper/5V7KPAPB"},"agent_actions":{"view_html":"https://pith.science/pith/5V7KPAPB2P3ZWK3YEFO5R7F3IA","download_json":"https://pith.science/pith/5V7KPAPB2P3ZWK3YEFO5R7F3IA.json","view_paper":"https://pith.science/paper/5V7KPAPB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.4408&json=true","fetch_graph":"https://pith.science/api/pith-number/5V7KPAPB2P3ZWK3YEFO5R7F3IA/graph.json","fetch_events":"https://pith.science/api/pith-number/5V7KPAPB2P3ZWK3YEFO5R7F3IA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5V7KPAPB2P3ZWK3YEFO5R7F3IA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5V7KPAPB2P3ZWK3YEFO5R7F3IA/action/storage_attestation","attest_author":"https://pith.science/pith/5V7KPAPB2P3ZWK3YEFO5R7F3IA/action/author_attestation","sign_citation":"https://pith.science/pith/5V7KPAPB2P3ZWK3YEFO5R7F3IA/action/citation_signature","submit_replication":"https://pith.science/pith/5V7KPAPB2P3ZWK3YEFO5R7F3IA/action/replication_record"}},"created_at":"2026-05-18T04:41:45.362979+00:00","updated_at":"2026-05-18T04:41:45.362979+00:00"}