{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2HITIH6L3NUGWD6NVKZGD3KKKQ","short_pith_number":"pith:2HITIH6L","canonical_record":{"source":{"id":"1707.06775","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-21T07:05:10Z","cross_cats_sorted":[],"title_canon_sha256":"035ed08c9f28e7f4656a97a0d392f22c1e976efa3297f233c58bd7e937810701","abstract_canon_sha256":"2010f703dac583b1abca85ef22856af7cb168f331eb1d7fd3b685b0c71d99320"},"schema_version":"1.0"},"canonical_sha256":"d1d1341fcbdb686b0fcdaab261ed4a543b3df937bcc9257fd648d5ab50bd9b3f","source":{"kind":"arxiv","id":"1707.06775","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06775","created_at":"2026-05-18T00:06:06Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06775v2","created_at":"2026-05-18T00:06:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06775","created_at":"2026-05-18T00:06:06Z"},{"alias_kind":"pith_short_12","alias_value":"2HITIH6L3NUG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2HITIH6L3NUGWD6N","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2HITIH6L","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2HITIH6L3NUGWD6NVKZGD3KKKQ","target":"record","payload":{"canonical_record":{"source":{"id":"1707.06775","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-21T07:05:10Z","cross_cats_sorted":[],"title_canon_sha256":"035ed08c9f28e7f4656a97a0d392f22c1e976efa3297f233c58bd7e937810701","abstract_canon_sha256":"2010f703dac583b1abca85ef22856af7cb168f331eb1d7fd3b685b0c71d99320"},"schema_version":"1.0"},"canonical_sha256":"d1d1341fcbdb686b0fcdaab261ed4a543b3df937bcc9257fd648d5ab50bd9b3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:06.203577Z","signature_b64":"f/8YSv1yp9C9eBYXHb5YuA+J0+IUgghJlER9lVsTAf0wLiYl+uHBImKVoh9/R3ws1qqZ+WBaw+Hj22LQur8nDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1d1341fcbdb686b0fcdaab261ed4a543b3df937bcc9257fd648d5ab50bd9b3f","last_reissued_at":"2026-05-18T00:06:06.202839Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:06.202839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.06775","source_version":2,"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:06:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QMo8GQXQ8rRgGhf731ZRYC44xOVtb/oTyMHpaj3/rc5fNKRtAXsna47qbg7wacV5rJp0JBP4LBuJnaTv9J8WCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:50:49.436362Z"},"content_sha256":"ae249120fa287086a95d374a07f02305a27f641fcca5d8f16040b5957afedfd0","schema_version":"1.0","event_id":"sha256:ae249120fa287086a95d374a07f02305a27f641fcca5d8f16040b5957afedfd0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2HITIH6L3NUGWD6NVKZGD3KKKQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reconfiguration on nowhere dense graph classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Sebastian Siebertz","submitted_at":"2017-07-21T07:05:10Z","abstract_excerpt":"Let $\\mathcal{Q}$ be a vertex subset problem on graphs. In a reconfiguration variant of $\\mathcal{Q}$ we are given a graph $G$ and two feasible solutions $S_s, S_t\\subseteq V(G)$ of $\\mathcal{Q}$ with $|S_s|=|S_t|=k$. The problem is to determine whether there exists a sequence $S_1,\\ldots,S_n$ of feasible solutions, where $S_1=S_s$, $S_n=S_t$, $|S_i|\\leq k\\pm 1$, and each $S_{i+1}$ results from $S_i$, $1\\leq i<n$, by the addition or removal of a single vertex. We prove that for every nowhere dense class of graphs and for every integer $r\\geq 1$ there exists a polynomial $p_r$ such that the rec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06775","kind":"arxiv","version":2},"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:06:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I2wCK0aYXiD2clecC/2kpLZa/V6B2hpFD3ernQKG6mYM87Ix/R2OIxCm+PMqt6JWd5vtsJcT0Vo98YlSRNPRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:50:49.437028Z"},"content_sha256":"e11058ff853b85dbeccd759da470a3c72365a323f6fdd308e48e5c1c9d166540","schema_version":"1.0","event_id":"sha256:e11058ff853b85dbeccd759da470a3c72365a323f6fdd308e48e5c1c9d166540"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2HITIH6L3NUGWD6NVKZGD3KKKQ/bundle.json","state_url":"https://pith.science/pith/2HITIH6L3NUGWD6NVKZGD3KKKQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2HITIH6L3NUGWD6NVKZGD3KKKQ/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-27T02:50:49Z","links":{"resolver":"https://pith.science/pith/2HITIH6L3NUGWD6NVKZGD3KKKQ","bundle":"https://pith.science/pith/2HITIH6L3NUGWD6NVKZGD3KKKQ/bundle.json","state":"https://pith.science/pith/2HITIH6L3NUGWD6NVKZGD3KKKQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2HITIH6L3NUGWD6NVKZGD3KKKQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2HITIH6L3NUGWD6NVKZGD3KKKQ","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":"2010f703dac583b1abca85ef22856af7cb168f331eb1d7fd3b685b0c71d99320","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-21T07:05:10Z","title_canon_sha256":"035ed08c9f28e7f4656a97a0d392f22c1e976efa3297f233c58bd7e937810701"},"schema_version":"1.0","source":{"id":"1707.06775","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06775","created_at":"2026-05-18T00:06:06Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06775v2","created_at":"2026-05-18T00:06:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06775","created_at":"2026-05-18T00:06:06Z"},{"alias_kind":"pith_short_12","alias_value":"2HITIH6L3NUG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2HITIH6L3NUGWD6N","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2HITIH6L","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:e11058ff853b85dbeccd759da470a3c72365a323f6fdd308e48e5c1c9d166540","target":"graph","created_at":"2026-05-18T00:06:06Z","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":"Let $\\mathcal{Q}$ be a vertex subset problem on graphs. In a reconfiguration variant of $\\mathcal{Q}$ we are given a graph $G$ and two feasible solutions $S_s, S_t\\subseteq V(G)$ of $\\mathcal{Q}$ with $|S_s|=|S_t|=k$. The problem is to determine whether there exists a sequence $S_1,\\ldots,S_n$ of feasible solutions, where $S_1=S_s$, $S_n=S_t$, $|S_i|\\leq k\\pm 1$, and each $S_{i+1}$ results from $S_i$, $1\\leq i<n$, by the addition or removal of a single vertex. We prove that for every nowhere dense class of graphs and for every integer $r\\geq 1$ there exists a polynomial $p_r$ such that the rec","authors_text":"Sebastian Siebertz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-21T07:05:10Z","title":"Reconfiguration on nowhere dense graph classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06775","kind":"arxiv","version":2},"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:ae249120fa287086a95d374a07f02305a27f641fcca5d8f16040b5957afedfd0","target":"record","created_at":"2026-05-18T00:06:06Z","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":"2010f703dac583b1abca85ef22856af7cb168f331eb1d7fd3b685b0c71d99320","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-21T07:05:10Z","title_canon_sha256":"035ed08c9f28e7f4656a97a0d392f22c1e976efa3297f233c58bd7e937810701"},"schema_version":"1.0","source":{"id":"1707.06775","kind":"arxiv","version":2}},"canonical_sha256":"d1d1341fcbdb686b0fcdaab261ed4a543b3df937bcc9257fd648d5ab50bd9b3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1d1341fcbdb686b0fcdaab261ed4a543b3df937bcc9257fd648d5ab50bd9b3f","first_computed_at":"2026-05-18T00:06:06.202839Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:06.202839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f/8YSv1yp9C9eBYXHb5YuA+J0+IUgghJlER9lVsTAf0wLiYl+uHBImKVoh9/R3ws1qqZ+WBaw+Hj22LQur8nDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:06.203577Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.06775","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae249120fa287086a95d374a07f02305a27f641fcca5d8f16040b5957afedfd0","sha256:e11058ff853b85dbeccd759da470a3c72365a323f6fdd308e48e5c1c9d166540"],"state_sha256":"b6b4d03c14f20a2354a93a3b79989d110d62d0f89fdf90f727ebd9e2aa42cc82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mzL7L0Bcr1ps5R/HEoecuz4KlEhWp+eUL1p8KkGSmnBD5Q8FzN8qDFyci3sOYcIWOTsSTRAIsBZdQz+jR2YmDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:50:49.440437Z","bundle_sha256":"4856677934474d84669438c698484cc0345e18dfc42cfe5ec60acce7c01178e1"}}