{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1994:AHDFBFWILXZVIWUGSO6KLD7EAF","short_pith_number":"pith:AHDFBFWI","schema_version":"1.0","canonical_sha256":"01c65096c85df3545a8693bca58fe4015332e3e2e041ff8b0808a562c6d8fad6","source":{"kind":"arxiv","id":"math/9409213","version":1},"attestation_state":"computed","paper":{"title":"Inverting sets and the packing problem","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emanuel Knill, Mark Goldberg, Thomas Spencer, Vance Faber","submitted_at":"1994-09-16T00:00:00Z","abstract_excerpt":"Given a set $V$, a subset $S$, and a permutation $\\pi$ of $V$, we say that $\\pi$ permutes $S$ if $\\pi (S) \\cap S = \\emptyset$. Given a collection $\\cS = \\{V; S_1,\\ldots , S_m\\}$, where $S_i \\subseteq V ~~(i=1,\\ldots ,m)$, we say that $\\cS$ is invertible if there is a permutation $\\pi$ of $V$ such that $\\pi (S_i) \\subseteq V-S_i$. In this paper, we present necessary and sufficient conditions for the invertibility of a collection and construct a polynomial algorithm which determines whether a given collection is invertible. For an arbitrary collection, we give a lower bound for the maximum numbe"},"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":"math/9409213","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"1994-09-16T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"606c834e741a224db974a5744f3eda33c9cd7e7098bd62c349c0e452f7b2b488","abstract_canon_sha256":"7390070f51f49a4d958b7b02282a41b4eaee3deca65e53a2df2c342863d9e8af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:51.110924Z","signature_b64":"seHX383Ykh9MjaH7BUTeRr3qaJOUvEPTAtygRuc4Og6LuFv5GSnb+Z+iaOVR2sLdVzp17F7dKBPKiIr1yu+iDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01c65096c85df3545a8693bca58fe4015332e3e2e041ff8b0808a562c6d8fad6","last_reissued_at":"2026-05-18T01:05:51.110301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:51.110301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inverting sets and the packing problem","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emanuel Knill, Mark Goldberg, Thomas Spencer, Vance Faber","submitted_at":"1994-09-16T00:00:00Z","abstract_excerpt":"Given a set $V$, a subset $S$, and a permutation $\\pi$ of $V$, we say that $\\pi$ permutes $S$ if $\\pi (S) \\cap S = \\emptyset$. Given a collection $\\cS = \\{V; S_1,\\ldots , S_m\\}$, where $S_i \\subseteq V ~~(i=1,\\ldots ,m)$, we say that $\\cS$ is invertible if there is a permutation $\\pi$ of $V$ such that $\\pi (S_i) \\subseteq V-S_i$. In this paper, we present necessary and sufficient conditions for the invertibility of a collection and construct a polynomial algorithm which determines whether a given collection is invertible. For an arbitrary collection, we give a lower bound for the maximum numbe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9409213","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":"math/9409213","created_at":"2026-05-18T01:05:51.110408+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/9409213v1","created_at":"2026-05-18T01:05:51.110408+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9409213","created_at":"2026-05-18T01:05:51.110408+00:00"},{"alias_kind":"pith_short_12","alias_value":"AHDFBFWILXZV","created_at":"2026-05-18T12:25:47.102015+00:00"},{"alias_kind":"pith_short_16","alias_value":"AHDFBFWILXZVIWUG","created_at":"2026-05-18T12:25:47.102015+00:00"},{"alias_kind":"pith_short_8","alias_value":"AHDFBFWI","created_at":"2026-05-18T12:25:47.102015+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/AHDFBFWILXZVIWUGSO6KLD7EAF","json":"https://pith.science/pith/AHDFBFWILXZVIWUGSO6KLD7EAF.json","graph_json":"https://pith.science/api/pith-number/AHDFBFWILXZVIWUGSO6KLD7EAF/graph.json","events_json":"https://pith.science/api/pith-number/AHDFBFWILXZVIWUGSO6KLD7EAF/events.json","paper":"https://pith.science/paper/AHDFBFWI"},"agent_actions":{"view_html":"https://pith.science/pith/AHDFBFWILXZVIWUGSO6KLD7EAF","download_json":"https://pith.science/pith/AHDFBFWILXZVIWUGSO6KLD7EAF.json","view_paper":"https://pith.science/paper/AHDFBFWI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/9409213&json=true","fetch_graph":"https://pith.science/api/pith-number/AHDFBFWILXZVIWUGSO6KLD7EAF/graph.json","fetch_events":"https://pith.science/api/pith-number/AHDFBFWILXZVIWUGSO6KLD7EAF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AHDFBFWILXZVIWUGSO6KLD7EAF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AHDFBFWILXZVIWUGSO6KLD7EAF/action/storage_attestation","attest_author":"https://pith.science/pith/AHDFBFWILXZVIWUGSO6KLD7EAF/action/author_attestation","sign_citation":"https://pith.science/pith/AHDFBFWILXZVIWUGSO6KLD7EAF/action/citation_signature","submit_replication":"https://pith.science/pith/AHDFBFWILXZVIWUGSO6KLD7EAF/action/replication_record"}},"created_at":"2026-05-18T01:05:51.110408+00:00","updated_at":"2026-05-18T01:05:51.110408+00:00"}