{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QV2W4WHNIA2GQWTIYHVB3KHRB7","short_pith_number":"pith:QV2W4WHN","canonical_record":{"source":{"id":"1706.07900","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-24T03:32:42Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"1184a03a29cb6057f02d1892d522fdcbf4d41cf2b1d28ccc25b4771a5d23c93f","abstract_canon_sha256":"ecee71509a2ad8350766f5e1747b4388aef7804defadafb9fa3f5aeaecc3d8e1"},"schema_version":"1.0"},"canonical_sha256":"85756e58ed4034685a68c1ea1da8f10ff52440d53b3c255dc209d9dab4914731","source":{"kind":"arxiv","id":"1706.07900","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07900","created_at":"2026-05-18T00:16:56Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07900v3","created_at":"2026-05-18T00:16:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07900","created_at":"2026-05-18T00:16:56Z"},{"alias_kind":"pith_short_12","alias_value":"QV2W4WHNIA2G","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QV2W4WHNIA2GQWTI","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QV2W4WHN","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QV2W4WHNIA2GQWTIYHVB3KHRB7","target":"record","payload":{"canonical_record":{"source":{"id":"1706.07900","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-24T03:32:42Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"1184a03a29cb6057f02d1892d522fdcbf4d41cf2b1d28ccc25b4771a5d23c93f","abstract_canon_sha256":"ecee71509a2ad8350766f5e1747b4388aef7804defadafb9fa3f5aeaecc3d8e1"},"schema_version":"1.0"},"canonical_sha256":"85756e58ed4034685a68c1ea1da8f10ff52440d53b3c255dc209d9dab4914731","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:56.345065Z","signature_b64":"Brn3WjThCfWhmQxJ4lBFc+PE3Qs/BvIMyOxs7IQRLrW1033U9PDgz3sP87jzl2j170aiAFjLOFc27BmW1QteDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85756e58ed4034685a68c1ea1da8f10ff52440d53b3c255dc209d9dab4914731","last_reissued_at":"2026-05-18T00:16:56.344390Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:56.344390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.07900","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-18T00:16:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lzeH3bCLF6ajO+iNDGoftwrmtfgz82ap2EddAAmdkWapu63DgcXZRj0Xvpji4P/PJAXDP5FQpPhUMOlFrCl5Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:30:10.907498Z"},"content_sha256":"7f1ea693ffedd98127f9f7300047fc75825b9dfa91392bdc0fc9d0fe159dd80c","schema_version":"1.0","event_id":"sha256:7f1ea693ffedd98127f9f7300047fc75825b9dfa91392bdc0fc9d0fe159dd80c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QV2W4WHNIA2GQWTIYHVB3KHRB7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tree-Residue Vertex-Breaking: a new tool for proving hardness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.CC","authors_text":"Erik D. Demaine, Mikhail Rudoy","submitted_at":"2017-06-24T03:32:42Z","abstract_excerpt":"In this paper, we introduce a new problem called Tree-Residue Vertex-Breaking (TRVB): given a multigraph $G$ some of whose vertices are marked \"breakable,\" is it possible to convert $G$ into a tree via a sequence of \"vertex-breaking\" operations (replacing a degree-$k$ breakable vertex by $k$ degree-$1$ vertices, disconnecting the $k$ incident edges)?\n  We characterize the computational complexity of TRVB with any combination of the following additional constraints: $G$ must be planar, $G$ must be a simple graph, the degree of every breakable vertex must belong to an allowed list $B$, and the d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07900","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-18T00:16:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ypQMs1Wv7xLM50NgWICCH4LGuwZkdLJw0kgUxgrN/p9v/8cEAvnjjKSjDKSGpmxHgbgKv6J4QndVro6HPmx0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:30:10.908072Z"},"content_sha256":"a95da96c656e9473e4f5d5e1d7da01eb935b143e88cc05864ad8ef5b18fcceb8","schema_version":"1.0","event_id":"sha256:a95da96c656e9473e4f5d5e1d7da01eb935b143e88cc05864ad8ef5b18fcceb8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QV2W4WHNIA2GQWTIYHVB3KHRB7/bundle.json","state_url":"https://pith.science/pith/QV2W4WHNIA2GQWTIYHVB3KHRB7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QV2W4WHNIA2GQWTIYHVB3KHRB7/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-05-27T08:30:10Z","links":{"resolver":"https://pith.science/pith/QV2W4WHNIA2GQWTIYHVB3KHRB7","bundle":"https://pith.science/pith/QV2W4WHNIA2GQWTIYHVB3KHRB7/bundle.json","state":"https://pith.science/pith/QV2W4WHNIA2GQWTIYHVB3KHRB7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QV2W4WHNIA2GQWTIYHVB3KHRB7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QV2W4WHNIA2GQWTIYHVB3KHRB7","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":"ecee71509a2ad8350766f5e1747b4388aef7804defadafb9fa3f5aeaecc3d8e1","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-24T03:32:42Z","title_canon_sha256":"1184a03a29cb6057f02d1892d522fdcbf4d41cf2b1d28ccc25b4771a5d23c93f"},"schema_version":"1.0","source":{"id":"1706.07900","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07900","created_at":"2026-05-18T00:16:56Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07900v3","created_at":"2026-05-18T00:16:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07900","created_at":"2026-05-18T00:16:56Z"},{"alias_kind":"pith_short_12","alias_value":"QV2W4WHNIA2G","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QV2W4WHNIA2GQWTI","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QV2W4WHN","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:a95da96c656e9473e4f5d5e1d7da01eb935b143e88cc05864ad8ef5b18fcceb8","target":"graph","created_at":"2026-05-18T00:16:56Z","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":"In this paper, we introduce a new problem called Tree-Residue Vertex-Breaking (TRVB): given a multigraph $G$ some of whose vertices are marked \"breakable,\" is it possible to convert $G$ into a tree via a sequence of \"vertex-breaking\" operations (replacing a degree-$k$ breakable vertex by $k$ degree-$1$ vertices, disconnecting the $k$ incident edges)?\n  We characterize the computational complexity of TRVB with any combination of the following additional constraints: $G$ must be planar, $G$ must be a simple graph, the degree of every breakable vertex must belong to an allowed list $B$, and the d","authors_text":"Erik D. Demaine, Mikhail Rudoy","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-24T03:32:42Z","title":"Tree-Residue Vertex-Breaking: a new tool for proving hardness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07900","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:7f1ea693ffedd98127f9f7300047fc75825b9dfa91392bdc0fc9d0fe159dd80c","target":"record","created_at":"2026-05-18T00:16:56Z","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":"ecee71509a2ad8350766f5e1747b4388aef7804defadafb9fa3f5aeaecc3d8e1","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-24T03:32:42Z","title_canon_sha256":"1184a03a29cb6057f02d1892d522fdcbf4d41cf2b1d28ccc25b4771a5d23c93f"},"schema_version":"1.0","source":{"id":"1706.07900","kind":"arxiv","version":3}},"canonical_sha256":"85756e58ed4034685a68c1ea1da8f10ff52440d53b3c255dc209d9dab4914731","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85756e58ed4034685a68c1ea1da8f10ff52440d53b3c255dc209d9dab4914731","first_computed_at":"2026-05-18T00:16:56.344390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:56.344390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Brn3WjThCfWhmQxJ4lBFc+PE3Qs/BvIMyOxs7IQRLrW1033U9PDgz3sP87jzl2j170aiAFjLOFc27BmW1QteDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:56.345065Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.07900","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f1ea693ffedd98127f9f7300047fc75825b9dfa91392bdc0fc9d0fe159dd80c","sha256:a95da96c656e9473e4f5d5e1d7da01eb935b143e88cc05864ad8ef5b18fcceb8"],"state_sha256":"b34994c6d069739baebcc35472f213734bfcd06995e9c46ba887535a6f3a37f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fXL0ugwabEvqxUNWA13l5b9Qnmw3xjHv6+D2RuItgAU8NZ8vfMciQFDmmmodPqRZy/1sQb+RpiMgxEhRcTZ/Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:30:10.910591Z","bundle_sha256":"1bdc6ff82326fd137b04f1bf6279d4bf16f3673be80d7e460baa43a3c60f62fc"}}