{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KJR4RNZWBVSFODD6FJHX3RHUQ2","short_pith_number":"pith:KJR4RNZW","canonical_record":{"source":{"id":"1503.00228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-01T07:41:15Z","cross_cats_sorted":[],"title_canon_sha256":"4fb70109d850b4fec0bae18cfb3d85bcbfb567243ade3ab6ae7ed072554635c6","abstract_canon_sha256":"6f9fc0ae9420820596898f6258034f0b5ebb26e208ae0169629fae18fe9e5df2"},"schema_version":"1.0"},"canonical_sha256":"5263c8b7360d64570c7e2a4f7dc4f486aa615f91c0dce11d10e1eba11eb68712","source":{"kind":"arxiv","id":"1503.00228","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00228","created_at":"2026-05-18T02:25:54Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00228v1","created_at":"2026-05-18T02:25:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00228","created_at":"2026-05-18T02:25:54Z"},{"alias_kind":"pith_short_12","alias_value":"KJR4RNZWBVSF","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KJR4RNZWBVSFODD6","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KJR4RNZW","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KJR4RNZWBVSFODD6FJHX3RHUQ2","target":"record","payload":{"canonical_record":{"source":{"id":"1503.00228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-01T07:41:15Z","cross_cats_sorted":[],"title_canon_sha256":"4fb70109d850b4fec0bae18cfb3d85bcbfb567243ade3ab6ae7ed072554635c6","abstract_canon_sha256":"6f9fc0ae9420820596898f6258034f0b5ebb26e208ae0169629fae18fe9e5df2"},"schema_version":"1.0"},"canonical_sha256":"5263c8b7360d64570c7e2a4f7dc4f486aa615f91c0dce11d10e1eba11eb68712","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:54.856659Z","signature_b64":"jO5Ez0gSmVRw3uTiRM1bOtZAk9v4MOA9gjSnXcvSNpbS+Y1p+ZROHnc1k6PXTiESzjuWhmjg71qQMlgSyIJgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5263c8b7360d64570c7e2a4f7dc4f486aa615f91c0dce11d10e1eba11eb68712","last_reissued_at":"2026-05-18T02:25:54.856140Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:54.856140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.00228","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-18T02:25:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gt8an0hVVrY42q6TqKzCqvGDmOoH7L2x1fNkDzWjeLZtn5euOrYjJT6ZAwucTh65fCcqGs1/CmgRiIM/HLMwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:59:13.715777Z"},"content_sha256":"6949092e8725aedbc2a4668521b0c01400dc2a60e4cb76378c4f0fac84d39d27","schema_version":"1.0","event_id":"sha256:6949092e8725aedbc2a4668521b0c01400dc2a60e4cb76378c4f0fac84d39d27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KJR4RNZWBVSFODD6FJHX3RHUQ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Largest minimal inversion-complete and pair-complete sets of permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eric Balandraud (IMJ), Fabio Tardella, Maurice Queyranne","submitted_at":"2015-03-01T07:41:15Z","abstract_excerpt":"We solve two related extremal problems in the theory of permutations. A set $Q$ of permutations of the integers 1 to $n$ is inversion-complete (resp., pair-complete) if for every inversion $(j,i)$, where $1 \\le i \\textless{} j \\le n$, (resp., for every pair $(i,j)$, where $i\\not= j$) there exists a permutation in~$Q$ where $j$ is before~$i$. It is minimally inversion-complete if in addition no proper subset of~$Q$ is inversion-complete; and similarly for pair-completeness. The problems we consider are to determine the maximum cardinality of a minimal inversion-complete set of permutations, and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00228","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-18T02:25:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8TTzz+6BAYhsOX5lFZ594BPIMu4FkEcXqlBJeDwhXziVFJf5vsAn9xiS6NP+RBwvttzL2k0m7kLGxghDrV/fCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:59:13.716505Z"},"content_sha256":"04975b28f47958d37637db518c35c55730da0cc2d68436c49f8de2830389407b","schema_version":"1.0","event_id":"sha256:04975b28f47958d37637db518c35c55730da0cc2d68436c49f8de2830389407b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KJR4RNZWBVSFODD6FJHX3RHUQ2/bundle.json","state_url":"https://pith.science/pith/KJR4RNZWBVSFODD6FJHX3RHUQ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KJR4RNZWBVSFODD6FJHX3RHUQ2/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-06-09T08:59:13Z","links":{"resolver":"https://pith.science/pith/KJR4RNZWBVSFODD6FJHX3RHUQ2","bundle":"https://pith.science/pith/KJR4RNZWBVSFODD6FJHX3RHUQ2/bundle.json","state":"https://pith.science/pith/KJR4RNZWBVSFODD6FJHX3RHUQ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KJR4RNZWBVSFODD6FJHX3RHUQ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KJR4RNZWBVSFODD6FJHX3RHUQ2","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":"6f9fc0ae9420820596898f6258034f0b5ebb26e208ae0169629fae18fe9e5df2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-01T07:41:15Z","title_canon_sha256":"4fb70109d850b4fec0bae18cfb3d85bcbfb567243ade3ab6ae7ed072554635c6"},"schema_version":"1.0","source":{"id":"1503.00228","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00228","created_at":"2026-05-18T02:25:54Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00228v1","created_at":"2026-05-18T02:25:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00228","created_at":"2026-05-18T02:25:54Z"},{"alias_kind":"pith_short_12","alias_value":"KJR4RNZWBVSF","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KJR4RNZWBVSFODD6","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KJR4RNZW","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:04975b28f47958d37637db518c35c55730da0cc2d68436c49f8de2830389407b","target":"graph","created_at":"2026-05-18T02:25:54Z","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":"We solve two related extremal problems in the theory of permutations. A set $Q$ of permutations of the integers 1 to $n$ is inversion-complete (resp., pair-complete) if for every inversion $(j,i)$, where $1 \\le i \\textless{} j \\le n$, (resp., for every pair $(i,j)$, where $i\\not= j$) there exists a permutation in~$Q$ where $j$ is before~$i$. It is minimally inversion-complete if in addition no proper subset of~$Q$ is inversion-complete; and similarly for pair-completeness. The problems we consider are to determine the maximum cardinality of a minimal inversion-complete set of permutations, and","authors_text":"Eric Balandraud (IMJ), Fabio Tardella, Maurice Queyranne","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-01T07:41:15Z","title":"Largest minimal inversion-complete and pair-complete sets of permutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00228","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:6949092e8725aedbc2a4668521b0c01400dc2a60e4cb76378c4f0fac84d39d27","target":"record","created_at":"2026-05-18T02:25:54Z","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":"6f9fc0ae9420820596898f6258034f0b5ebb26e208ae0169629fae18fe9e5df2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-01T07:41:15Z","title_canon_sha256":"4fb70109d850b4fec0bae18cfb3d85bcbfb567243ade3ab6ae7ed072554635c6"},"schema_version":"1.0","source":{"id":"1503.00228","kind":"arxiv","version":1}},"canonical_sha256":"5263c8b7360d64570c7e2a4f7dc4f486aa615f91c0dce11d10e1eba11eb68712","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5263c8b7360d64570c7e2a4f7dc4f486aa615f91c0dce11d10e1eba11eb68712","first_computed_at":"2026-05-18T02:25:54.856140Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:54.856140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jO5Ez0gSmVRw3uTiRM1bOtZAk9v4MOA9gjSnXcvSNpbS+Y1p+ZROHnc1k6PXTiESzjuWhmjg71qQMlgSyIJgAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:54.856659Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.00228","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6949092e8725aedbc2a4668521b0c01400dc2a60e4cb76378c4f0fac84d39d27","sha256:04975b28f47958d37637db518c35c55730da0cc2d68436c49f8de2830389407b"],"state_sha256":"65fba61f730324d3873652fd4ea1d4d8ec09158c9ac6842caa0fbdcf7e225cbc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jgZWHvhfKGDmgLwnNn8twKwZy0UbKqaV0w214lwuIsWR03C30U06Dju6/zzxnM8CdNRcvG50SreJx5swOXZuDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:59:13.720844Z","bundle_sha256":"fcce118f00bcf53424d98ffeb6becb1c621a5e532a71995fb85a1cbcd271b662"}}