{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:Y5CL4WOQBUTWPFLHSOW3B5BAE2","short_pith_number":"pith:Y5CL4WOQ","canonical_record":{"source":{"id":"1506.05079","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-16T19:12:08Z","cross_cats_sorted":[],"title_canon_sha256":"19a85a467208489819a1dbfc5dd24e907af59aaf07789f58fc2c0ca0d805b887","abstract_canon_sha256":"39920a02170d4c156c40b84b95ef9a9789551029d92cbbce0a5dca1d407411d6"},"schema_version":"1.0"},"canonical_sha256":"c744be59d00d2767956793adb0f420268fdcccffa9c1c84418d6522aca0b66c3","source":{"kind":"arxiv","id":"1506.05079","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05079","created_at":"2026-05-18T01:37:07Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05079v2","created_at":"2026-05-18T01:37:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05079","created_at":"2026-05-18T01:37:07Z"},{"alias_kind":"pith_short_12","alias_value":"Y5CL4WOQBUTW","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"Y5CL4WOQBUTWPFLH","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"Y5CL4WOQ","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:Y5CL4WOQBUTWPFLHSOW3B5BAE2","target":"record","payload":{"canonical_record":{"source":{"id":"1506.05079","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-16T19:12:08Z","cross_cats_sorted":[],"title_canon_sha256":"19a85a467208489819a1dbfc5dd24e907af59aaf07789f58fc2c0ca0d805b887","abstract_canon_sha256":"39920a02170d4c156c40b84b95ef9a9789551029d92cbbce0a5dca1d407411d6"},"schema_version":"1.0"},"canonical_sha256":"c744be59d00d2767956793adb0f420268fdcccffa9c1c84418d6522aca0b66c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:07.189009Z","signature_b64":"WWdl1P7otNS24fXZNnHLH3ClceU5t8zrMqPokm1+zSiItaMH0OkoHEstSjglOs+l2trEMgXJGO9AOtrXvTjPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c744be59d00d2767956793adb0f420268fdcccffa9c1c84418d6522aca0b66c3","last_reissued_at":"2026-05-18T01:37:07.188514Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:07.188514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.05079","source_version":2,"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:37:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7hrI+tSr+7Ig4S6j+EkjazkMWytfHQ4tQFTr9/5F53SSnFS+rxIPfWj7qDzGlVSxJgZQ2jMe0VLbPp80t2xrDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:10:33.340746Z"},"content_sha256":"9885af5e9dbe98e9da6f69d67421c6dab75f1904d54643dde5c8620e1dea8b29","schema_version":"1.0","event_id":"sha256:9885af5e9dbe98e9da6f69d67421c6dab75f1904d54643dde5c8620e1dea8b29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:Y5CL4WOQBUTWPFLHSOW3B5BAE2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"All Permutations Supersequence is coNP-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Przemys{\\l}aw Uzna\\'nski","submitted_at":"2015-06-16T19:12:08Z","abstract_excerpt":"We prove that deciding whether a given input word contains as subsequence every possible permutation of integers $\\{1,2,\\ldots,n\\}$ is coNP-complete. The coNP-completeness holds even when given the guarantee that the input word contains as subsequences all of length $n-1$ sequences over the same set of integers. We also show NP-completeness of a related problem of Partially Non-crossing Perfect Matching in Bipartite Graphs, i.e. to find a perfect matching in an ordered bipartite graph where edges of the matching incident to selected vertices (even only from one side) are non-crossing."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05079","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":""},"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:37:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7XBcv8i7PrBgcuabWUu4H6izOIghz4Si75UZfGa7040VkgjjJRMEpAg/kkQU5hcegHb972G44Typx9AFpc5jCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:10:33.341459Z"},"content_sha256":"3ccba1144b539a50221a8e8cdb29e0960c498439f2500e628c2e7c66eb9fcce6","schema_version":"1.0","event_id":"sha256:3ccba1144b539a50221a8e8cdb29e0960c498439f2500e628c2e7c66eb9fcce6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y5CL4WOQBUTWPFLHSOW3B5BAE2/bundle.json","state_url":"https://pith.science/pith/Y5CL4WOQBUTWPFLHSOW3B5BAE2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y5CL4WOQBUTWPFLHSOW3B5BAE2/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-09T06:10:33Z","links":{"resolver":"https://pith.science/pith/Y5CL4WOQBUTWPFLHSOW3B5BAE2","bundle":"https://pith.science/pith/Y5CL4WOQBUTWPFLHSOW3B5BAE2/bundle.json","state":"https://pith.science/pith/Y5CL4WOQBUTWPFLHSOW3B5BAE2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y5CL4WOQBUTWPFLHSOW3B5BAE2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:Y5CL4WOQBUTWPFLHSOW3B5BAE2","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":"39920a02170d4c156c40b84b95ef9a9789551029d92cbbce0a5dca1d407411d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-16T19:12:08Z","title_canon_sha256":"19a85a467208489819a1dbfc5dd24e907af59aaf07789f58fc2c0ca0d805b887"},"schema_version":"1.0","source":{"id":"1506.05079","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05079","created_at":"2026-05-18T01:37:07Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05079v2","created_at":"2026-05-18T01:37:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05079","created_at":"2026-05-18T01:37:07Z"},{"alias_kind":"pith_short_12","alias_value":"Y5CL4WOQBUTW","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"Y5CL4WOQBUTWPFLH","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"Y5CL4WOQ","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:3ccba1144b539a50221a8e8cdb29e0960c498439f2500e628c2e7c66eb9fcce6","target":"graph","created_at":"2026-05-18T01:37:07Z","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 prove that deciding whether a given input word contains as subsequence every possible permutation of integers $\\{1,2,\\ldots,n\\}$ is coNP-complete. The coNP-completeness holds even when given the guarantee that the input word contains as subsequences all of length $n-1$ sequences over the same set of integers. We also show NP-completeness of a related problem of Partially Non-crossing Perfect Matching in Bipartite Graphs, i.e. to find a perfect matching in an ordered bipartite graph where edges of the matching incident to selected vertices (even only from one side) are non-crossing.","authors_text":"Przemys{\\l}aw Uzna\\'nski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-16T19:12:08Z","title":"All Permutations Supersequence is coNP-complete"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05079","kind":"arxiv","version":2},"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:9885af5e9dbe98e9da6f69d67421c6dab75f1904d54643dde5c8620e1dea8b29","target":"record","created_at":"2026-05-18T01:37:07Z","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":"39920a02170d4c156c40b84b95ef9a9789551029d92cbbce0a5dca1d407411d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-16T19:12:08Z","title_canon_sha256":"19a85a467208489819a1dbfc5dd24e907af59aaf07789f58fc2c0ca0d805b887"},"schema_version":"1.0","source":{"id":"1506.05079","kind":"arxiv","version":2}},"canonical_sha256":"c744be59d00d2767956793adb0f420268fdcccffa9c1c84418d6522aca0b66c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c744be59d00d2767956793adb0f420268fdcccffa9c1c84418d6522aca0b66c3","first_computed_at":"2026-05-18T01:37:07.188514Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:07.188514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WWdl1P7otNS24fXZNnHLH3ClceU5t8zrMqPokm1+zSiItaMH0OkoHEstSjglOs+l2trEMgXJGO9AOtrXvTjPBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:07.189009Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.05079","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9885af5e9dbe98e9da6f69d67421c6dab75f1904d54643dde5c8620e1dea8b29","sha256:3ccba1144b539a50221a8e8cdb29e0960c498439f2500e628c2e7c66eb9fcce6"],"state_sha256":"7b85558ff48825674ee308f7963ddae4bbc5e5fa4c33cfe111e4f080cb6436bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ULSZJeeBc9IF7TcqyJefs7pnHrSRP4u1Q9Kvc6LYh7zUdb854liDtTjeeoE8JxRzm5WuKdYqC2+CBW09H4XCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:10:33.345468Z","bundle_sha256":"92a54ec05ea6df6a8fc3de9ed737a58a6f38e4fe14c6678c3cf40f6ca5b3212b"}}