{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PQNER3WWSY7JFS5J5PUOJS63PH","short_pith_number":"pith:PQNER3WW","canonical_record":{"source":{"id":"1507.05841","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-21T14:12:29Z","cross_cats_sorted":[],"title_canon_sha256":"7549e2c7959aabae98426e7c8a5bd3f94e5c0f52bb9dc47dbffc6819e64e9895","abstract_canon_sha256":"02945d487f0a6749575dd1a2854b3d0e254a6b417a863cd334639af91241e322"},"schema_version":"1.0"},"canonical_sha256":"7c1a48eed6963e92cba9ebe8e4cbdb79c55830261ed42bcb17ae22db7bd2e2c4","source":{"kind":"arxiv","id":"1507.05841","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05841","created_at":"2026-05-18T01:22:37Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05841v3","created_at":"2026-05-18T01:22:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05841","created_at":"2026-05-18T01:22:37Z"},{"alias_kind":"pith_short_12","alias_value":"PQNER3WWSY7J","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PQNER3WWSY7JFS5J","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PQNER3WW","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PQNER3WWSY7JFS5J5PUOJS63PH","target":"record","payload":{"canonical_record":{"source":{"id":"1507.05841","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-21T14:12:29Z","cross_cats_sorted":[],"title_canon_sha256":"7549e2c7959aabae98426e7c8a5bd3f94e5c0f52bb9dc47dbffc6819e64e9895","abstract_canon_sha256":"02945d487f0a6749575dd1a2854b3d0e254a6b417a863cd334639af91241e322"},"schema_version":"1.0"},"canonical_sha256":"7c1a48eed6963e92cba9ebe8e4cbdb79c55830261ed42bcb17ae22db7bd2e2c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:37.715201Z","signature_b64":"RS/dd0SmZyvBTzSTHoVvgBLnUpAxJvZhfzFo6GtLjNeGRRrswGICzw9o54IjZ5EJcHwdXGprR3xvKX6n2sAyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c1a48eed6963e92cba9ebe8e4cbdb79c55830261ed42bcb17ae22db7bd2e2c4","last_reissued_at":"2026-05-18T01:22:37.714742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:37.714742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.05841","source_version":3,"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:22:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oMdW7MOB/uqhQrX5ESZiFNGGyLwc7E63grF2fdKYCAJ3xhdVR86JA0piuROHyPbZetUQSSWdClsXCvAiO8aFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:12:41.826358Z"},"content_sha256":"8f2bf8479a1f27fdb126bb18dbef362ff3c78f05bb1f58af9a72f1ae3f5bb6f9","schema_version":"1.0","event_id":"sha256:8f2bf8479a1f27fdb126bb18dbef362ff3c78f05bb1f58af9a72f1ae3f5bb6f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PQNER3WWSY7JFS5J5PUOJS63PH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the GI-Completeness of a Sorting Networks Isomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"David Gregg, Martin Marinov","submitted_at":"2015-07-21T14:12:29Z","abstract_excerpt":"The subitemset isomorphism problem is really important and there are excellent practical solutions described in the literature. However, the computational complexity analysis and classification of the BZ (Bundala and Zavodny) subitemset isomorphism problem is currently an open problem. In this paper we prove that checking whether two sorting networks are BZ isomorphic to each other is GI-Complete; the general GI (Graph Isomorphism) problem is known to be in NP and LWPP, but widely believed to be neither P nor NP-Complete; recent research suggests that the problem is in QP. Moreover, we state t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05841","kind":"arxiv","version":3},"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:22:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ff+5Vd5O1Ezo0D+ESiyB0BeIvpf9gIJs34AnGxEDZJSy7t4GiXU+bVMWC5gH7Ifjmb2/noa7z5Cnnzju4WqHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:12:41.826703Z"},"content_sha256":"fa08741c19c0e324f1a93d41e79c1e33fe93f5748591ba5586471e61dcb7d23f","schema_version":"1.0","event_id":"sha256:fa08741c19c0e324f1a93d41e79c1e33fe93f5748591ba5586471e61dcb7d23f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PQNER3WWSY7JFS5J5PUOJS63PH/bundle.json","state_url":"https://pith.science/pith/PQNER3WWSY7JFS5J5PUOJS63PH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PQNER3WWSY7JFS5J5PUOJS63PH/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-01T21:12:41Z","links":{"resolver":"https://pith.science/pith/PQNER3WWSY7JFS5J5PUOJS63PH","bundle":"https://pith.science/pith/PQNER3WWSY7JFS5J5PUOJS63PH/bundle.json","state":"https://pith.science/pith/PQNER3WWSY7JFS5J5PUOJS63PH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PQNER3WWSY7JFS5J5PUOJS63PH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PQNER3WWSY7JFS5J5PUOJS63PH","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":"02945d487f0a6749575dd1a2854b3d0e254a6b417a863cd334639af91241e322","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-21T14:12:29Z","title_canon_sha256":"7549e2c7959aabae98426e7c8a5bd3f94e5c0f52bb9dc47dbffc6819e64e9895"},"schema_version":"1.0","source":{"id":"1507.05841","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05841","created_at":"2026-05-18T01:22:37Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05841v3","created_at":"2026-05-18T01:22:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05841","created_at":"2026-05-18T01:22:37Z"},{"alias_kind":"pith_short_12","alias_value":"PQNER3WWSY7J","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PQNER3WWSY7JFS5J","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PQNER3WW","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:fa08741c19c0e324f1a93d41e79c1e33fe93f5748591ba5586471e61dcb7d23f","target":"graph","created_at":"2026-05-18T01:22:37Z","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":"The subitemset isomorphism problem is really important and there are excellent practical solutions described in the literature. However, the computational complexity analysis and classification of the BZ (Bundala and Zavodny) subitemset isomorphism problem is currently an open problem. In this paper we prove that checking whether two sorting networks are BZ isomorphic to each other is GI-Complete; the general GI (Graph Isomorphism) problem is known to be in NP and LWPP, but widely believed to be neither P nor NP-Complete; recent research suggests that the problem is in QP. Moreover, we state t","authors_text":"David Gregg, Martin Marinov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-21T14:12:29Z","title":"On the GI-Completeness of a Sorting Networks Isomorphism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05841","kind":"arxiv","version":3},"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:8f2bf8479a1f27fdb126bb18dbef362ff3c78f05bb1f58af9a72f1ae3f5bb6f9","target":"record","created_at":"2026-05-18T01:22:37Z","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":"02945d487f0a6749575dd1a2854b3d0e254a6b417a863cd334639af91241e322","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-21T14:12:29Z","title_canon_sha256":"7549e2c7959aabae98426e7c8a5bd3f94e5c0f52bb9dc47dbffc6819e64e9895"},"schema_version":"1.0","source":{"id":"1507.05841","kind":"arxiv","version":3}},"canonical_sha256":"7c1a48eed6963e92cba9ebe8e4cbdb79c55830261ed42bcb17ae22db7bd2e2c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c1a48eed6963e92cba9ebe8e4cbdb79c55830261ed42bcb17ae22db7bd2e2c4","first_computed_at":"2026-05-18T01:22:37.714742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:37.714742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RS/dd0SmZyvBTzSTHoVvgBLnUpAxJvZhfzFo6GtLjNeGRRrswGICzw9o54IjZ5EJcHwdXGprR3xvKX6n2sAyBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:37.715201Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05841","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f2bf8479a1f27fdb126bb18dbef362ff3c78f05bb1f58af9a72f1ae3f5bb6f9","sha256:fa08741c19c0e324f1a93d41e79c1e33fe93f5748591ba5586471e61dcb7d23f"],"state_sha256":"248c97c9013a417a855790b6406a61cf925cdcd28c8bc5d940bcbe4606421dcd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W1FKgkhmjHBLcdaDY4L8hcBZFH7pXci2BUmwS3DSr0JcZY5Yw4hhIT93Gi+zS1uvZ8f5/eMsmq439fhSbXgUDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:12:41.828662Z","bundle_sha256":"713d13e686405cd58679980e0caf681b07aa3a411255a8b003177327cbac2d56"}}