{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:5PP5WM57ZP4AEAK5YRCG6I3VLM","short_pith_number":"pith:5PP5WM57","canonical_record":{"source":{"id":"1012.2460","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-11T14:38:41Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ac1b412374182ce659ad084f390fbe588b063235de93daaf7eb0b942be5213a9","abstract_canon_sha256":"642afce97c53edc1062944835471e2a3f7103e9cfecb8038ab5f07fd1d22064f"},"schema_version":"1.0"},"canonical_sha256":"ebdfdb33bfcbf802015dc4446f23755b19c1ccb9dffae3948111b2a9efef4ee8","source":{"kind":"arxiv","id":"1012.2460","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.2460","created_at":"2026-05-18T04:33:28Z"},{"alias_kind":"arxiv_version","alias_value":"1012.2460v1","created_at":"2026-05-18T04:33:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2460","created_at":"2026-05-18T04:33:28Z"},{"alias_kind":"pith_short_12","alias_value":"5PP5WM57ZP4A","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5PP5WM57ZP4AEAK5","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5PP5WM57","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:5PP5WM57ZP4AEAK5YRCG6I3VLM","target":"record","payload":{"canonical_record":{"source":{"id":"1012.2460","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-11T14:38:41Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ac1b412374182ce659ad084f390fbe588b063235de93daaf7eb0b942be5213a9","abstract_canon_sha256":"642afce97c53edc1062944835471e2a3f7103e9cfecb8038ab5f07fd1d22064f"},"schema_version":"1.0"},"canonical_sha256":"ebdfdb33bfcbf802015dc4446f23755b19c1ccb9dffae3948111b2a9efef4ee8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:28.587049Z","signature_b64":"6u7fepA/DYzq/i496n7/4YS8VCPdLpHmnJrRYw1qruMdwIKQK6kDs6hDdZY+Aqks/NrHzOxUQjYD//RS0LnQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebdfdb33bfcbf802015dc4446f23755b19c1ccb9dffae3948111b2a9efef4ee8","last_reissued_at":"2026-05-18T04:33:28.586568Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:28.586568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.2460","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-18T04:33:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mtv3KGz89Qqtu0wS+sKDYGP2ATk/HyrismZC/b3okprolvlUatbUt7SyG7PNaRbxMHqtUyIFnOkfI4JTqzNXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:34:04.844479Z"},"content_sha256":"e6b1e743b7506c262a56a10b4ef656ab840860a784a408620574dfeb871160f4","schema_version":"1.0","event_id":"sha256:e6b1e743b7506c262a56a10b4ef656ab840860a784a408620574dfeb871160f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:5PP5WM57ZP4AEAK5YRCG6I3VLM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Contracting planar graphs to contractions of triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Daniel Paulusma, Dimitrios M. Thilikos, Marcin Kaminski","submitted_at":"2010-12-11T14:38:41Z","abstract_excerpt":"For every graph $H$, there exists a polynomial-time algorithm deciding if a planar input graph $G$ can be contracted to~$H$. However, the degree of the polynomial depends on the size of $H$. In this paper, we identify a class of graphs $\\cal C$ such that for every $H \\in \\cal C$, there exists an algorithm deciding in time $f(|V(H)|) \\cdot |V(G)|^{\\bigO{1}}$ whether a planar graph $G$ can be contracted to~$H$. (The function $f(\\cdot)$ does not depend on $G$.) The class $\\cal C$ is the closure of planar triangulated graphs under taking of contractions. In fact, we prove that a graph $H \\in \\cal "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2460","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-18T04:33:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/UqPNFkJFwDx0JamleymToBf1wDgE8vONAt3GE/Rkw1MDdC4uE6j+K/3nP7+i4MxSlSd5wJJp9b+2gKsb4vaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:34:04.845191Z"},"content_sha256":"de569d3ea41c761626f5ce8de58a0a0cf988d96e561918f51bfa2fde0f6ded69","schema_version":"1.0","event_id":"sha256:de569d3ea41c761626f5ce8de58a0a0cf988d96e561918f51bfa2fde0f6ded69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5PP5WM57ZP4AEAK5YRCG6I3VLM/bundle.json","state_url":"https://pith.science/pith/5PP5WM57ZP4AEAK5YRCG6I3VLM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5PP5WM57ZP4AEAK5YRCG6I3VLM/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-25T19:34:04Z","links":{"resolver":"https://pith.science/pith/5PP5WM57ZP4AEAK5YRCG6I3VLM","bundle":"https://pith.science/pith/5PP5WM57ZP4AEAK5YRCG6I3VLM/bundle.json","state":"https://pith.science/pith/5PP5WM57ZP4AEAK5YRCG6I3VLM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5PP5WM57ZP4AEAK5YRCG6I3VLM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:5PP5WM57ZP4AEAK5YRCG6I3VLM","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":"642afce97c53edc1062944835471e2a3f7103e9cfecb8038ab5f07fd1d22064f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-11T14:38:41Z","title_canon_sha256":"ac1b412374182ce659ad084f390fbe588b063235de93daaf7eb0b942be5213a9"},"schema_version":"1.0","source":{"id":"1012.2460","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.2460","created_at":"2026-05-18T04:33:28Z"},{"alias_kind":"arxiv_version","alias_value":"1012.2460v1","created_at":"2026-05-18T04:33:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2460","created_at":"2026-05-18T04:33:28Z"},{"alias_kind":"pith_short_12","alias_value":"5PP5WM57ZP4A","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5PP5WM57ZP4AEAK5","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5PP5WM57","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:de569d3ea41c761626f5ce8de58a0a0cf988d96e561918f51bfa2fde0f6ded69","target":"graph","created_at":"2026-05-18T04:33:28Z","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":"For every graph $H$, there exists a polynomial-time algorithm deciding if a planar input graph $G$ can be contracted to~$H$. However, the degree of the polynomial depends on the size of $H$. In this paper, we identify a class of graphs $\\cal C$ such that for every $H \\in \\cal C$, there exists an algorithm deciding in time $f(|V(H)|) \\cdot |V(G)|^{\\bigO{1}}$ whether a planar graph $G$ can be contracted to~$H$. (The function $f(\\cdot)$ does not depend on $G$.) The class $\\cal C$ is the closure of planar triangulated graphs under taking of contractions. In fact, we prove that a graph $H \\in \\cal ","authors_text":"Daniel Paulusma, Dimitrios M. Thilikos, Marcin Kaminski","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-11T14:38:41Z","title":"Contracting planar graphs to contractions of triangulations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2460","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:e6b1e743b7506c262a56a10b4ef656ab840860a784a408620574dfeb871160f4","target":"record","created_at":"2026-05-18T04:33:28Z","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":"642afce97c53edc1062944835471e2a3f7103e9cfecb8038ab5f07fd1d22064f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-11T14:38:41Z","title_canon_sha256":"ac1b412374182ce659ad084f390fbe588b063235de93daaf7eb0b942be5213a9"},"schema_version":"1.0","source":{"id":"1012.2460","kind":"arxiv","version":1}},"canonical_sha256":"ebdfdb33bfcbf802015dc4446f23755b19c1ccb9dffae3948111b2a9efef4ee8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ebdfdb33bfcbf802015dc4446f23755b19c1ccb9dffae3948111b2a9efef4ee8","first_computed_at":"2026-05-18T04:33:28.586568Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:33:28.586568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6u7fepA/DYzq/i496n7/4YS8VCPdLpHmnJrRYw1qruMdwIKQK6kDs6hDdZY+Aqks/NrHzOxUQjYD//RS0LnQDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:33:28.587049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.2460","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6b1e743b7506c262a56a10b4ef656ab840860a784a408620574dfeb871160f4","sha256:de569d3ea41c761626f5ce8de58a0a0cf988d96e561918f51bfa2fde0f6ded69"],"state_sha256":"f2a7b2847d066b882c7134c0fa0b856399e528427627c6622479f9d46a427bc9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AwZozXUfJ9zIzOitQw/twLAUls3ywgmPEifwS7gTuFxV+P9XHpaITp01FjKMIjnC136VK0752Vt/UFvXqjdkAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:34:04.849046Z","bundle_sha256":"6ac1ebe5c6b3dc60d899535941bfd3841cba069806f9f9c715354f60f3b7ed2b"}}