{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ATD7VUHSMV6BZSCFSDYMKUXBDK","short_pith_number":"pith:ATD7VUHS","schema_version":"1.0","canonical_sha256":"04c7fad0f2657c1cc84590f0c552e11aa1b9f89e3ac49c0f648491fc4ed9f0e0","source":{"kind":"arxiv","id":"1602.04042","version":2},"attestation_state":"computed","paper":{"title":"Packing and Covering Immersion Models of Planar subcubic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Archontia Giannopoulou, Dimitrios M. Thilikos, Jean-Florent Raymond, O-joung Kwon","submitted_at":"2016-02-12T13:14:08Z","abstract_excerpt":"A graph $H$ is an immersion of a graph $G$ if $H$ can be obtained by some sugraph $G$ after lifting incident edges. We prove that there is a polynomial function $f:\\Bbb{N}\\times\\Bbb{N}\\rightarrow\\Bbb{N}$, such that if $H$ is a connected planar subcubic graph on $h>0$ edges, $G$ is a graph, and $k$ is a non-negative integer, then either $G$ contains $k$ vertex/edge-disjoint subgraphs, each containing $H$ as an immersion, or $G$ contains a set $F$ of $f(k,h)$ vertices/edges such that $G\\setminus F$ does not contain $H$ as an immersion."},"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":"1602.04042","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-12T13:14:08Z","cross_cats_sorted":[],"title_canon_sha256":"fd077c2b0c204b107acab9fda18990714b16b1efcbc99494bd59885c8bf8da66","abstract_canon_sha256":"de1392de9d459a6df869e0c2b7b2d98fecb7c1617897c93074af1e95128d92cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:33.756706Z","signature_b64":"Nj05V3T4DU8jB2Q84HjK1pe4xkILW4zDG9hsBJLYHMWumqTUJ8YP9ZRBN9BcKeL/VeQEsEdSPkgF3RSOXRKkDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04c7fad0f2657c1cc84590f0c552e11aa1b9f89e3ac49c0f648491fc4ed9f0e0","last_reissued_at":"2026-05-18T01:19:33.756282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:33.756282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Packing and Covering Immersion Models of Planar subcubic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Archontia Giannopoulou, Dimitrios M. Thilikos, Jean-Florent Raymond, O-joung Kwon","submitted_at":"2016-02-12T13:14:08Z","abstract_excerpt":"A graph $H$ is an immersion of a graph $G$ if $H$ can be obtained by some sugraph $G$ after lifting incident edges. We prove that there is a polynomial function $f:\\Bbb{N}\\times\\Bbb{N}\\rightarrow\\Bbb{N}$, such that if $H$ is a connected planar subcubic graph on $h>0$ edges, $G$ is a graph, and $k$ is a non-negative integer, then either $G$ contains $k$ vertex/edge-disjoint subgraphs, each containing $H$ as an immersion, or $G$ contains a set $F$ of $f(k,h)$ vertices/edges such that $G\\setminus F$ does not contain $H$ as an immersion."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04042","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.04042","created_at":"2026-05-18T01:19:33.756347+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.04042v2","created_at":"2026-05-18T01:19:33.756347+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04042","created_at":"2026-05-18T01:19:33.756347+00:00"},{"alias_kind":"pith_short_12","alias_value":"ATD7VUHSMV6B","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"ATD7VUHSMV6BZSCF","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"ATD7VUHS","created_at":"2026-05-18T12:30:07.202191+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ATD7VUHSMV6BZSCFSDYMKUXBDK","json":"https://pith.science/pith/ATD7VUHSMV6BZSCFSDYMKUXBDK.json","graph_json":"https://pith.science/api/pith-number/ATD7VUHSMV6BZSCFSDYMKUXBDK/graph.json","events_json":"https://pith.science/api/pith-number/ATD7VUHSMV6BZSCFSDYMKUXBDK/events.json","paper":"https://pith.science/paper/ATD7VUHS"},"agent_actions":{"view_html":"https://pith.science/pith/ATD7VUHSMV6BZSCFSDYMKUXBDK","download_json":"https://pith.science/pith/ATD7VUHSMV6BZSCFSDYMKUXBDK.json","view_paper":"https://pith.science/paper/ATD7VUHS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.04042&json=true","fetch_graph":"https://pith.science/api/pith-number/ATD7VUHSMV6BZSCFSDYMKUXBDK/graph.json","fetch_events":"https://pith.science/api/pith-number/ATD7VUHSMV6BZSCFSDYMKUXBDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ATD7VUHSMV6BZSCFSDYMKUXBDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ATD7VUHSMV6BZSCFSDYMKUXBDK/action/storage_attestation","attest_author":"https://pith.science/pith/ATD7VUHSMV6BZSCFSDYMKUXBDK/action/author_attestation","sign_citation":"https://pith.science/pith/ATD7VUHSMV6BZSCFSDYMKUXBDK/action/citation_signature","submit_replication":"https://pith.science/pith/ATD7VUHSMV6BZSCFSDYMKUXBDK/action/replication_record"}},"created_at":"2026-05-18T01:19:33.756347+00:00","updated_at":"2026-05-18T01:19:33.756347+00:00"}