{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QV2W4WHNIA2GQWTIYHVB3KHRB7","short_pith_number":"pith:QV2W4WHN","schema_version":"1.0","canonical_sha256":"85756e58ed4034685a68c1ea1da8f10ff52440d53b3c255dc209d9dab4914731","source":{"kind":"arxiv","id":"1706.07900","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.07900","created_at":"2026-05-18T00:16:56.344518+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.07900v3","created_at":"2026-05-18T00:16:56.344518+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07900","created_at":"2026-05-18T00:16:56.344518+00:00"},{"alias_kind":"pith_short_12","alias_value":"QV2W4WHNIA2G","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QV2W4WHNIA2GQWTI","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QV2W4WHN","created_at":"2026-05-18T12:31:39.905425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2405.08377","citing_title":"ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QV2W4WHNIA2GQWTIYHVB3KHRB7","json":"https://pith.science/pith/QV2W4WHNIA2GQWTIYHVB3KHRB7.json","graph_json":"https://pith.science/api/pith-number/QV2W4WHNIA2GQWTIYHVB3KHRB7/graph.json","events_json":"https://pith.science/api/pith-number/QV2W4WHNIA2GQWTIYHVB3KHRB7/events.json","paper":"https://pith.science/paper/QV2W4WHN"},"agent_actions":{"view_html":"https://pith.science/pith/QV2W4WHNIA2GQWTIYHVB3KHRB7","download_json":"https://pith.science/pith/QV2W4WHNIA2GQWTIYHVB3KHRB7.json","view_paper":"https://pith.science/paper/QV2W4WHN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.07900&json=true","fetch_graph":"https://pith.science/api/pith-number/QV2W4WHNIA2GQWTIYHVB3KHRB7/graph.json","fetch_events":"https://pith.science/api/pith-number/QV2W4WHNIA2GQWTIYHVB3KHRB7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QV2W4WHNIA2GQWTIYHVB3KHRB7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QV2W4WHNIA2GQWTIYHVB3KHRB7/action/storage_attestation","attest_author":"https://pith.science/pith/QV2W4WHNIA2GQWTIYHVB3KHRB7/action/author_attestation","sign_citation":"https://pith.science/pith/QV2W4WHNIA2GQWTIYHVB3KHRB7/action/citation_signature","submit_replication":"https://pith.science/pith/QV2W4WHNIA2GQWTIYHVB3KHRB7/action/replication_record"}},"created_at":"2026-05-18T00:16:56.344518+00:00","updated_at":"2026-05-18T00:16:56.344518+00:00"}