{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PQNER3WWSY7JFS5J5PUOJS63PH","short_pith_number":"pith:PQNER3WW","schema_version":"1.0","canonical_sha256":"7c1a48eed6963e92cba9ebe8e4cbdb79c55830261ed42bcb17ae22db7bd2e2c4","source":{"kind":"arxiv","id":"1507.05841","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.05841","created_at":"2026-05-18T01:22:37.714811+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.05841v3","created_at":"2026-05-18T01:22:37.714811+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05841","created_at":"2026-05-18T01:22:37.714811+00:00"},{"alias_kind":"pith_short_12","alias_value":"PQNER3WWSY7J","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PQNER3WWSY7JFS5J","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PQNER3WW","created_at":"2026-05-18T12:29:37.295048+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/PQNER3WWSY7JFS5J5PUOJS63PH","json":"https://pith.science/pith/PQNER3WWSY7JFS5J5PUOJS63PH.json","graph_json":"https://pith.science/api/pith-number/PQNER3WWSY7JFS5J5PUOJS63PH/graph.json","events_json":"https://pith.science/api/pith-number/PQNER3WWSY7JFS5J5PUOJS63PH/events.json","paper":"https://pith.science/paper/PQNER3WW"},"agent_actions":{"view_html":"https://pith.science/pith/PQNER3WWSY7JFS5J5PUOJS63PH","download_json":"https://pith.science/pith/PQNER3WWSY7JFS5J5PUOJS63PH.json","view_paper":"https://pith.science/paper/PQNER3WW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.05841&json=true","fetch_graph":"https://pith.science/api/pith-number/PQNER3WWSY7JFS5J5PUOJS63PH/graph.json","fetch_events":"https://pith.science/api/pith-number/PQNER3WWSY7JFS5J5PUOJS63PH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PQNER3WWSY7JFS5J5PUOJS63PH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PQNER3WWSY7JFS5J5PUOJS63PH/action/storage_attestation","attest_author":"https://pith.science/pith/PQNER3WWSY7JFS5J5PUOJS63PH/action/author_attestation","sign_citation":"https://pith.science/pith/PQNER3WWSY7JFS5J5PUOJS63PH/action/citation_signature","submit_replication":"https://pith.science/pith/PQNER3WWSY7JFS5J5PUOJS63PH/action/replication_record"}},"created_at":"2026-05-18T01:22:37.714811+00:00","updated_at":"2026-05-18T01:22:37.714811+00:00"}