{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:1994:AHDFBFWILXZVIWUGSO6KLD7EAF","short_pith_number":"pith:AHDFBFWI","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"},"canonical_sha256":"01c65096c85df3545a8693bca58fe4015332e3e2e041ff8b0808a562c6d8fad6","source":{"kind":"arxiv","id":"math/9409213","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/9409213","created_at":"2026-05-18T01:05:51Z"},{"alias_kind":"arxiv_version","alias_value":"math/9409213v1","created_at":"2026-05-18T01:05:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9409213","created_at":"2026-05-18T01:05:51Z"},{"alias_kind":"pith_short_12","alias_value":"AHDFBFWILXZV","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"AHDFBFWILXZVIWUG","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"AHDFBFWI","created_at":"2026-05-18T12:25:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:1994:AHDFBFWILXZVIWUGSO6KLD7EAF","target":"record","payload":{"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"},"canonical_sha256":"01c65096c85df3545a8693bca58fe4015332e3e2e041ff8b0808a562c6d8fad6","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"},"source_kind":"arxiv","source_id":"math/9409213","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:05:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"opds8+jZz3A8M3E5nQyqM2UEa8i0N9TuE8eNlK3txLkcPU/TF5YK1QtCIq1EkW71ga+zlEOi1lET/VBziifQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T10:42:36.961045Z"},"content_sha256":"f6d2e650ebb1b578b65eb1552ac0fb5e3be3fddf36e8bb14623238b2868d7523","schema_version":"1.0","event_id":"sha256:f6d2e650ebb1b578b65eb1552ac0fb5e3be3fddf36e8bb14623238b2868d7523"},{"event_type":"graph_snapshot","subject_pith_number":"pith:1994:AHDFBFWILXZVIWUGSO6KLD7EAF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:05:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i14gZ+xtuwAlEX7L7o8zHFb1rACuZ/m6V0Dxd2yrd0buLqPDDiKe1T1ub9jfCRTrWb6Dxma1RKWEMH2Kxv/ECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T10:42:36.961400Z"},"content_sha256":"164c02d54c367e170a270cc7d9062149b9af04ac11d533cfa7c835098d55dad7","schema_version":"1.0","event_id":"sha256:164c02d54c367e170a270cc7d9062149b9af04ac11d533cfa7c835098d55dad7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AHDFBFWILXZVIWUGSO6KLD7EAF/bundle.json","state_url":"https://pith.science/pith/AHDFBFWILXZVIWUGSO6KLD7EAF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AHDFBFWILXZVIWUGSO6KLD7EAF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-20T10:42:36Z","links":{"resolver":"https://pith.science/pith/AHDFBFWILXZVIWUGSO6KLD7EAF","bundle":"https://pith.science/pith/AHDFBFWILXZVIWUGSO6KLD7EAF/bundle.json","state":"https://pith.science/pith/AHDFBFWILXZVIWUGSO6KLD7EAF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AHDFBFWILXZVIWUGSO6KLD7EAF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1994:AHDFBFWILXZVIWUGSO6KLD7EAF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7390070f51f49a4d958b7b02282a41b4eaee3deca65e53a2df2c342863d9e8af","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"1994-09-16T00:00:00Z","title_canon_sha256":"606c834e741a224db974a5744f3eda33c9cd7e7098bd62c349c0e452f7b2b488"},"schema_version":"1.0","source":{"id":"math/9409213","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/9409213","created_at":"2026-05-18T01:05:51Z"},{"alias_kind":"arxiv_version","alias_value":"math/9409213v1","created_at":"2026-05-18T01:05:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9409213","created_at":"2026-05-18T01:05:51Z"},{"alias_kind":"pith_short_12","alias_value":"AHDFBFWILXZV","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"AHDFBFWILXZVIWUG","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"AHDFBFWI","created_at":"2026-05-18T12:25:47Z"}],"graph_snapshots":[{"event_id":"sha256:164c02d54c367e170a270cc7d9062149b9af04ac11d533cfa7c835098d55dad7","target":"graph","created_at":"2026-05-18T01:05:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Emanuel Knill, Mark Goldberg, Thomas Spencer, Vance Faber","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"1994-09-16T00:00:00Z","title":"Inverting sets and the packing problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9409213","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f6d2e650ebb1b578b65eb1552ac0fb5e3be3fddf36e8bb14623238b2868d7523","target":"record","created_at":"2026-05-18T01:05:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7390070f51f49a4d958b7b02282a41b4eaee3deca65e53a2df2c342863d9e8af","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"1994-09-16T00:00:00Z","title_canon_sha256":"606c834e741a224db974a5744f3eda33c9cd7e7098bd62c349c0e452f7b2b488"},"schema_version":"1.0","source":{"id":"math/9409213","kind":"arxiv","version":1}},"canonical_sha256":"01c65096c85df3545a8693bca58fe4015332e3e2e041ff8b0808a562c6d8fad6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01c65096c85df3545a8693bca58fe4015332e3e2e041ff8b0808a562c6d8fad6","first_computed_at":"2026-05-18T01:05:51.110301Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:51.110301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"seHX383Ykh9MjaH7BUTeRr3qaJOUvEPTAtygRuc4Og6LuFv5GSnb+Z+iaOVR2sLdVzp17F7dKBPKiIr1yu+iDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:51.110924Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/9409213","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6d2e650ebb1b578b65eb1552ac0fb5e3be3fddf36e8bb14623238b2868d7523","sha256:164c02d54c367e170a270cc7d9062149b9af04ac11d533cfa7c835098d55dad7"],"state_sha256":"2dc2771efcf87f34c1c0299dba145f43dfd50e5ce619f4274efa29c1f7085521"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H44duiyc8YBwdMeI9lAYd2315VREj9FjVy8SEf33ZqhNLkM6qGE+FcrV/Ku8JxnyI0r7x2PYGLay/ZNhADrrCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T10:42:36.963599Z","bundle_sha256":"8ec94bec16b05a974e668b67de9252d8a019b5ea79c9d8c8482fea02b72cf011"}}