{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5JILMRC6G74XQLT2QPOAUNOGB3","short_pith_number":"pith:5JILMRC6","schema_version":"1.0","canonical_sha256":"ea50b6445e37f9782e7a83dc0a35c60ece4f75bcea27feeafa3852cf678014aa","source":{"kind":"arxiv","id":"2210.00245","version":2},"attestation_state":"computed","paper":{"title":"Uniqueness for 2-Intersecting Families of Permutations and Perfect Matchings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gilad Chase, Nathan Lindzey, Neta Dafni, Yuval Filmus","submitted_at":"2022-10-01T10:38:56Z","abstract_excerpt":"We give a characterization of the largest $2$-intersecting families of permutations of $\\{1,2,\\ldots,n\\}$ and of perfect matchings of the complete graph $K_{2n}$ for all $n \\geq 2$."},"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":"2210.00245","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-10-01T10:38:56Z","cross_cats_sorted":[],"title_canon_sha256":"4032c1634b740046e9c5c23cc49450e29d72a5e83bc698cce6de62e4becbac21","abstract_canon_sha256":"b9f083aca2ca30d8451e49d289bf1d9918d1d503aebfcdfc63154298c7fcb741"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:09:45.051244Z","signature_b64":"EF/vVF8j68Z1wnwmtzpbWgpLLWWp37R3HmCyMPL7DakRmQ4uXyFjp7DkG7tzGnLAZh2x6g/lTbNGkCcAO3m3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea50b6445e37f9782e7a83dc0a35c60ece4f75bcea27feeafa3852cf678014aa","last_reissued_at":"2026-06-19T16:09:45.050852Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:09:45.050852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uniqueness for 2-Intersecting Families of Permutations and Perfect Matchings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gilad Chase, Nathan Lindzey, Neta Dafni, Yuval Filmus","submitted_at":"2022-10-01T10:38:56Z","abstract_excerpt":"We give a characterization of the largest $2$-intersecting families of permutations of $\\{1,2,\\ldots,n\\}$ and of perfect matchings of the complete graph $K_{2n}$ for all $n \\geq 2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.00245","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.00245/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2210.00245","created_at":"2026-06-19T16:09:45.050910+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.00245v2","created_at":"2026-06-19T16:09:45.050910+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.00245","created_at":"2026-06-19T16:09:45.050910+00:00"},{"alias_kind":"pith_short_12","alias_value":"5JILMRC6G74X","created_at":"2026-06-19T16:09:45.050910+00:00"},{"alias_kind":"pith_short_16","alias_value":"5JILMRC6G74XQLT2","created_at":"2026-06-19T16:09:45.050910+00:00"},{"alias_kind":"pith_short_8","alias_value":"5JILMRC6","created_at":"2026-06-19T16:09:45.050910+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/5JILMRC6G74XQLT2QPOAUNOGB3","json":"https://pith.science/pith/5JILMRC6G74XQLT2QPOAUNOGB3.json","graph_json":"https://pith.science/api/pith-number/5JILMRC6G74XQLT2QPOAUNOGB3/graph.json","events_json":"https://pith.science/api/pith-number/5JILMRC6G74XQLT2QPOAUNOGB3/events.json","paper":"https://pith.science/paper/5JILMRC6"},"agent_actions":{"view_html":"https://pith.science/pith/5JILMRC6G74XQLT2QPOAUNOGB3","download_json":"https://pith.science/pith/5JILMRC6G74XQLT2QPOAUNOGB3.json","view_paper":"https://pith.science/paper/5JILMRC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.00245&json=true","fetch_graph":"https://pith.science/api/pith-number/5JILMRC6G74XQLT2QPOAUNOGB3/graph.json","fetch_events":"https://pith.science/api/pith-number/5JILMRC6G74XQLT2QPOAUNOGB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5JILMRC6G74XQLT2QPOAUNOGB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5JILMRC6G74XQLT2QPOAUNOGB3/action/storage_attestation","attest_author":"https://pith.science/pith/5JILMRC6G74XQLT2QPOAUNOGB3/action/author_attestation","sign_citation":"https://pith.science/pith/5JILMRC6G74XQLT2QPOAUNOGB3/action/citation_signature","submit_replication":"https://pith.science/pith/5JILMRC6G74XQLT2QPOAUNOGB3/action/replication_record"}},"created_at":"2026-06-19T16:09:45.050910+00:00","updated_at":"2026-06-19T16:09:45.050910+00:00"}