{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AJLTGO7DGHN6XU6QV4RFI3HJIT","short_pith_number":"pith:AJLTGO7D","canonical_record":{"source":{"id":"1709.10063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-28T17:08:11Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"913d54e663df3804592863db660bcddef4952aa9d131a395f3b69ba1f177342f","abstract_canon_sha256":"f2b57f1b95478e913d55cc67e7122f4251a969624775d7e4c528722e453b70f5"},"schema_version":"1.0"},"canonical_sha256":"0257333be331dbebd3d0af22546ce944dbf574f7debb6f5d7c5b1cab93f76d87","source":{"kind":"arxiv","id":"1709.10063","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.10063","created_at":"2026-05-18T00:34:05Z"},{"alias_kind":"arxiv_version","alias_value":"1709.10063v1","created_at":"2026-05-18T00:34:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.10063","created_at":"2026-05-18T00:34:05Z"},{"alias_kind":"pith_short_12","alias_value":"AJLTGO7DGHN6","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AJLTGO7DGHN6XU6Q","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AJLTGO7D","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AJLTGO7DGHN6XU6QV4RFI3HJIT","target":"record","payload":{"canonical_record":{"source":{"id":"1709.10063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-28T17:08:11Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"913d54e663df3804592863db660bcddef4952aa9d131a395f3b69ba1f177342f","abstract_canon_sha256":"f2b57f1b95478e913d55cc67e7122f4251a969624775d7e4c528722e453b70f5"},"schema_version":"1.0"},"canonical_sha256":"0257333be331dbebd3d0af22546ce944dbf574f7debb6f5d7c5b1cab93f76d87","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:05.803541Z","signature_b64":"cKYsjDjf+EWbMpmggc+OKXrUBiTdAOPOVwOaXtTRm3cyvrKf1V1V4slFAp6/KPkmsEkqvoCGu4zOxnczn+SUDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0257333be331dbebd3d0af22546ce944dbf574f7debb6f5d7c5b1cab93f76d87","last_reissued_at":"2026-05-18T00:34:05.802934Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:05.802934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.10063","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-18T00:34:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XAU+2Eonui2YxAnpwwHqF0885x5eV3/tXGJDJLz5TLxLc8qdaYlJsJThvyYeoXGtwJNuwO8tDlrDh3IMyDidBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:58:45.788088Z"},"content_sha256":"242f5b6604815d687ca7a54dfedd156ae64eca1ca14c4c6c02c72fa104354116","schema_version":"1.0","event_id":"sha256:242f5b6604815d687ca7a54dfedd156ae64eca1ca14c4c6c02c72fa104354116"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AJLTGO7DGHN6XU6QV4RFI3HJIT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Jacobo Toran, Johannes K\\\"obler, Sebastian Kuhnert, V. Arvind","submitted_at":"2017-09-28T17:08:11Z","abstract_excerpt":"Lubiw showed that several variants of Graph Isomorphism are NP-complete, where the solutions are required to satisfy certain additional constraints [SICOMP 10, 1981]. One of these, called Isomorphism With Restrictions, is to decide for two given graphs $X_1=(V,E_1)$ and $X_2=(V,E_2)$ and a subset $R\\subseteq V\\times V$ of forbidden pairs whether there is an isomorphism $\\pi$ from $X_1$ to $X_2$ such that $\\pi(i)\\neq j$ for all $(i,j)\\in R$. We prove that this problem and several of its generalizations are in fact in FPT:\n  - The problem of deciding whether there is an isomorphism between two g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.10063","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-18T00:34:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ANMxvuCgb02F/4i1w/LbhNrL7LzA5MGdOsbptiIIl3Wgz9L94XrNL/ftbX37uLAd0/ZkK/5M28TwbusaF8wDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:58:45.788450Z"},"content_sha256":"9060fc17fe60f1c79fba1bb11247ca1ba0b4aed37498aba43babae4f27c27d33","schema_version":"1.0","event_id":"sha256:9060fc17fe60f1c79fba1bb11247ca1ba0b4aed37498aba43babae4f27c27d33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AJLTGO7DGHN6XU6QV4RFI3HJIT/bundle.json","state_url":"https://pith.science/pith/AJLTGO7DGHN6XU6QV4RFI3HJIT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AJLTGO7DGHN6XU6QV4RFI3HJIT/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-02T18:58:45Z","links":{"resolver":"https://pith.science/pith/AJLTGO7DGHN6XU6QV4RFI3HJIT","bundle":"https://pith.science/pith/AJLTGO7DGHN6XU6QV4RFI3HJIT/bundle.json","state":"https://pith.science/pith/AJLTGO7DGHN6XU6QV4RFI3HJIT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AJLTGO7DGHN6XU6QV4RFI3HJIT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AJLTGO7DGHN6XU6QV4RFI3HJIT","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":"f2b57f1b95478e913d55cc67e7122f4251a969624775d7e4c528722e453b70f5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-28T17:08:11Z","title_canon_sha256":"913d54e663df3804592863db660bcddef4952aa9d131a395f3b69ba1f177342f"},"schema_version":"1.0","source":{"id":"1709.10063","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.10063","created_at":"2026-05-18T00:34:05Z"},{"alias_kind":"arxiv_version","alias_value":"1709.10063v1","created_at":"2026-05-18T00:34:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.10063","created_at":"2026-05-18T00:34:05Z"},{"alias_kind":"pith_short_12","alias_value":"AJLTGO7DGHN6","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AJLTGO7DGHN6XU6Q","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AJLTGO7D","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:9060fc17fe60f1c79fba1bb11247ca1ba0b4aed37498aba43babae4f27c27d33","target":"graph","created_at":"2026-05-18T00:34:05Z","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":"Lubiw showed that several variants of Graph Isomorphism are NP-complete, where the solutions are required to satisfy certain additional constraints [SICOMP 10, 1981]. One of these, called Isomorphism With Restrictions, is to decide for two given graphs $X_1=(V,E_1)$ and $X_2=(V,E_2)$ and a subset $R\\subseteq V\\times V$ of forbidden pairs whether there is an isomorphism $\\pi$ from $X_1$ to $X_2$ such that $\\pi(i)\\neq j$ for all $(i,j)\\in R$. We prove that this problem and several of its generalizations are in fact in FPT:\n  - The problem of deciding whether there is an isomorphism between two g","authors_text":"Jacobo Toran, Johannes K\\\"obler, Sebastian Kuhnert, V. Arvind","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-28T17:08:11Z","title":"Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.10063","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:242f5b6604815d687ca7a54dfedd156ae64eca1ca14c4c6c02c72fa104354116","target":"record","created_at":"2026-05-18T00:34:05Z","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":"f2b57f1b95478e913d55cc67e7122f4251a969624775d7e4c528722e453b70f5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-28T17:08:11Z","title_canon_sha256":"913d54e663df3804592863db660bcddef4952aa9d131a395f3b69ba1f177342f"},"schema_version":"1.0","source":{"id":"1709.10063","kind":"arxiv","version":1}},"canonical_sha256":"0257333be331dbebd3d0af22546ce944dbf574f7debb6f5d7c5b1cab93f76d87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0257333be331dbebd3d0af22546ce944dbf574f7debb6f5d7c5b1cab93f76d87","first_computed_at":"2026-05-18T00:34:05.802934Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:05.802934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cKYsjDjf+EWbMpmggc+OKXrUBiTdAOPOVwOaXtTRm3cyvrKf1V1V4slFAp6/KPkmsEkqvoCGu4zOxnczn+SUDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:05.803541Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.10063","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:242f5b6604815d687ca7a54dfedd156ae64eca1ca14c4c6c02c72fa104354116","sha256:9060fc17fe60f1c79fba1bb11247ca1ba0b4aed37498aba43babae4f27c27d33"],"state_sha256":"015cfc8a2beb78d7ad5f22b76743f0f8557b20ec43ceb84b87a8fe36d281a33d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xbqh1SMoqDuDhRrMT48ggmQ2oIZK34s0PSN60Caezn6Q3NmyYQbCCVQpb2qWc/FJg32QlKhsoyg08thnGSeVDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:58:45.790430Z","bundle_sha256":"e1b50459ddd9504de92c3cd539e17bf1650cfc98c922cf6129411e4b47f5aad3"}}