{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZHX6PXSZ256GQXGV7IHS34OKLY","short_pith_number":"pith:ZHX6PXSZ","canonical_record":{"source":{"id":"1710.10979","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-30T14:34:45Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cb777d25a37e300909511f18029c2950ab7ecef89c24282ed9476f51b80b32c2","abstract_canon_sha256":"31fd1f4a182d93d3e4e5d9e57946a479a0bb82173b8f44f51b145da415180236"},"schema_version":"1.0"},"canonical_sha256":"c9efe7de59d77c685cd5fa0f2df1ca5e280376285b659b8808d736f31dff47b1","source":{"kind":"arxiv","id":"1710.10979","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10979","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10979v1","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10979","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZHX6PXSZ256G","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZHX6PXSZ256GQXGV","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZHX6PXSZ","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZHX6PXSZ256GQXGV7IHS34OKLY","target":"record","payload":{"canonical_record":{"source":{"id":"1710.10979","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-30T14:34:45Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cb777d25a37e300909511f18029c2950ab7ecef89c24282ed9476f51b80b32c2","abstract_canon_sha256":"31fd1f4a182d93d3e4e5d9e57946a479a0bb82173b8f44f51b145da415180236"},"schema_version":"1.0"},"canonical_sha256":"c9efe7de59d77c685cd5fa0f2df1ca5e280376285b659b8808d736f31dff47b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:45.960211Z","signature_b64":"foSoXCKgmsDvyTcx6bGN4OhZQ9hbFgWKuv+picZlsDXakVv2L9Me1HUVU8LBvyeGH+HBQazG6Xs+5S1BIJL4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9efe7de59d77c685cd5fa0f2df1ca5e280376285b659b8808d736f31dff47b1","last_reissued_at":"2026-05-18T00:31:45.959704Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:45.959704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.10979","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:31:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ZbfNKXA/VGm2h1b+XpIOEfTazclKReBWhZEG8/NeJ59XhoskI7eF67LxniKLqZQOL//F7RafE9yc6xScQKxCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T09:19:33.001156Z"},"content_sha256":"baaa9c775ffa7a6ab53b7a7bfda06c80c1fc4b2f2d172464a29a03608f2d58d9","schema_version":"1.0","event_id":"sha256:baaa9c775ffa7a6ab53b7a7bfda06c80c1fc4b2f2d172464a29a03608f2d58d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZHX6PXSZ256GQXGV7IHS34OKLY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Connected Secluded Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Paloma Lima, Pedro Montealegre, Petr A. Golovach, Pinar Heggernes","submitted_at":"2017-10-30T14:34:45Z","abstract_excerpt":"Problems related to finding induced subgraphs satisfying given properties form one of the most studied areas within graph algorithms. Such problems have given rise to breakthrough results and led to development of new techniques both within the traditional P vs NP dichotomy and within parameterized complexity. The \\Pi-Subgraph problem asks whether an input graph contains an induced subgraph on at least k vertices satisfying graph property \\Pi. For many applications, it is desirable that the found subgraph has as few connections to the rest of the graph as possible, which gives rise to the Secl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10979","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:31:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cfhX4gC5n4XeNdPdRdy77AMMQdqRKgcnephuwzENjq3P4+8+9eHc/NYOCbfdNwjwkVkvBsa5JXkK3pJAV9rYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T09:19:33.001521Z"},"content_sha256":"9206b35e90d03c120ccd0468ebb7926304399e6e586c6dc385da424c4e4f002a","schema_version":"1.0","event_id":"sha256:9206b35e90d03c120ccd0468ebb7926304399e6e586c6dc385da424c4e4f002a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZHX6PXSZ256GQXGV7IHS34OKLY/bundle.json","state_url":"https://pith.science/pith/ZHX6PXSZ256GQXGV7IHS34OKLY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZHX6PXSZ256GQXGV7IHS34OKLY/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-04T09:19:33Z","links":{"resolver":"https://pith.science/pith/ZHX6PXSZ256GQXGV7IHS34OKLY","bundle":"https://pith.science/pith/ZHX6PXSZ256GQXGV7IHS34OKLY/bundle.json","state":"https://pith.science/pith/ZHX6PXSZ256GQXGV7IHS34OKLY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZHX6PXSZ256GQXGV7IHS34OKLY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZHX6PXSZ256GQXGV7IHS34OKLY","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":"31fd1f4a182d93d3e4e5d9e57946a479a0bb82173b8f44f51b145da415180236","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-30T14:34:45Z","title_canon_sha256":"cb777d25a37e300909511f18029c2950ab7ecef89c24282ed9476f51b80b32c2"},"schema_version":"1.0","source":{"id":"1710.10979","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10979","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10979v1","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10979","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZHX6PXSZ256G","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZHX6PXSZ256GQXGV","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZHX6PXSZ","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:9206b35e90d03c120ccd0468ebb7926304399e6e586c6dc385da424c4e4f002a","target":"graph","created_at":"2026-05-18T00:31:45Z","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":"Problems related to finding induced subgraphs satisfying given properties form one of the most studied areas within graph algorithms. Such problems have given rise to breakthrough results and led to development of new techniques both within the traditional P vs NP dichotomy and within parameterized complexity. The \\Pi-Subgraph problem asks whether an input graph contains an induced subgraph on at least k vertices satisfying graph property \\Pi. For many applications, it is desirable that the found subgraph has as few connections to the rest of the graph as possible, which gives rise to the Secl","authors_text":"Paloma Lima, Pedro Montealegre, Petr A. Golovach, Pinar Heggernes","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-30T14:34:45Z","title":"Finding Connected Secluded Subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10979","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:baaa9c775ffa7a6ab53b7a7bfda06c80c1fc4b2f2d172464a29a03608f2d58d9","target":"record","created_at":"2026-05-18T00:31:45Z","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":"31fd1f4a182d93d3e4e5d9e57946a479a0bb82173b8f44f51b145da415180236","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-30T14:34:45Z","title_canon_sha256":"cb777d25a37e300909511f18029c2950ab7ecef89c24282ed9476f51b80b32c2"},"schema_version":"1.0","source":{"id":"1710.10979","kind":"arxiv","version":1}},"canonical_sha256":"c9efe7de59d77c685cd5fa0f2df1ca5e280376285b659b8808d736f31dff47b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9efe7de59d77c685cd5fa0f2df1ca5e280376285b659b8808d736f31dff47b1","first_computed_at":"2026-05-18T00:31:45.959704Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:45.959704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"foSoXCKgmsDvyTcx6bGN4OhZQ9hbFgWKuv+picZlsDXakVv2L9Me1HUVU8LBvyeGH+HBQazG6Xs+5S1BIJL4BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:45.960211Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.10979","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:baaa9c775ffa7a6ab53b7a7bfda06c80c1fc4b2f2d172464a29a03608f2d58d9","sha256:9206b35e90d03c120ccd0468ebb7926304399e6e586c6dc385da424c4e4f002a"],"state_sha256":"6e9c777f152f9565baa098f27b0f7a4baf469920f4241f83e6e61efe5fde2ead"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1dwp2Gwi+E/9w0W8ZF19JvM6k24vaUffYA/WUYIJusBj9mHCXy4QxmPikxqFOffTsetmmIbFbA6v8sYlsiRyCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T09:19:33.003510Z","bundle_sha256":"41e7500a083e6d58811bf5e8019f21762770127dbb92a29f310286349621400e"}}