{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RT6WKQWF6NDCKKJLHVUABBZRMH","short_pith_number":"pith:RT6WKQWF","schema_version":"1.0","canonical_sha256":"8cfd6542c5f34625292b3d6800873161eba02c269d0cb9cd157dd19ae12aac94","source":{"kind":"arxiv","id":"1302.4249","version":1},"attestation_state":"computed","paper":{"title":"On a generalization of Kelly's combinatorial lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aymen Ben Amira, Hamza Si Kaddour, Jamel Dammak","submitted_at":"2013-02-18T12:46:32Z","abstract_excerpt":"Kelly's combinatorial lemma is a basic tool in the study of Ulam's reconstruction conjecture. A generalization in terms of a family of t-elements subsets of a v-element set was given by Pouzet. We consider a version of this generalization modulo a prime p. We give illustrations to graphs and tournaments."},"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":"1302.4249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-18T12:46:32Z","cross_cats_sorted":[],"title_canon_sha256":"452ddf870b81b27fdc8eae93c9974ad5463258807941c63b2c5218ea31f0cc18","abstract_canon_sha256":"3ab5bc4a7892aea2b0262885a3bf02029aa4d0e3c531446fc73f3716df707684"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:23.572712Z","signature_b64":"Gw5sOlll2Gk7sOVlGx3VFWZM8L/zY+4nf3EQqGq7EKJ0xPftktIKAu1zwxxUBMMIFI/eVKR1HRGKV+uYHnMiAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cfd6542c5f34625292b3d6800873161eba02c269d0cb9cd157dd19ae12aac94","last_reissued_at":"2026-05-18T03:33:23.571733Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:23.571733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a generalization of Kelly's combinatorial lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aymen Ben Amira, Hamza Si Kaddour, Jamel Dammak","submitted_at":"2013-02-18T12:46:32Z","abstract_excerpt":"Kelly's combinatorial lemma is a basic tool in the study of Ulam's reconstruction conjecture. A generalization in terms of a family of t-elements subsets of a v-element set was given by Pouzet. We consider a version of this generalization modulo a prime p. We give illustrations to graphs and tournaments."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4249","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":"1302.4249","created_at":"2026-05-18T03:33:23.571889+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4249v1","created_at":"2026-05-18T03:33:23.571889+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4249","created_at":"2026-05-18T03:33:23.571889+00:00"},{"alias_kind":"pith_short_12","alias_value":"RT6WKQWF6NDC","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"RT6WKQWF6NDCKKJL","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"RT6WKQWF","created_at":"2026-05-18T12:27:59.945178+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/RT6WKQWF6NDCKKJLHVUABBZRMH","json":"https://pith.science/pith/RT6WKQWF6NDCKKJLHVUABBZRMH.json","graph_json":"https://pith.science/api/pith-number/RT6WKQWF6NDCKKJLHVUABBZRMH/graph.json","events_json":"https://pith.science/api/pith-number/RT6WKQWF6NDCKKJLHVUABBZRMH/events.json","paper":"https://pith.science/paper/RT6WKQWF"},"agent_actions":{"view_html":"https://pith.science/pith/RT6WKQWF6NDCKKJLHVUABBZRMH","download_json":"https://pith.science/pith/RT6WKQWF6NDCKKJLHVUABBZRMH.json","view_paper":"https://pith.science/paper/RT6WKQWF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4249&json=true","fetch_graph":"https://pith.science/api/pith-number/RT6WKQWF6NDCKKJLHVUABBZRMH/graph.json","fetch_events":"https://pith.science/api/pith-number/RT6WKQWF6NDCKKJLHVUABBZRMH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RT6WKQWF6NDCKKJLHVUABBZRMH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RT6WKQWF6NDCKKJLHVUABBZRMH/action/storage_attestation","attest_author":"https://pith.science/pith/RT6WKQWF6NDCKKJLHVUABBZRMH/action/author_attestation","sign_citation":"https://pith.science/pith/RT6WKQWF6NDCKKJLHVUABBZRMH/action/citation_signature","submit_replication":"https://pith.science/pith/RT6WKQWF6NDCKKJLHVUABBZRMH/action/replication_record"}},"created_at":"2026-05-18T03:33:23.571889+00:00","updated_at":"2026-05-18T03:33:23.571889+00:00"}