{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RHD4ANFGNRNPYYBNWBBH7W6TUZ","short_pith_number":"pith:RHD4ANFG","schema_version":"1.0","canonical_sha256":"89c7c034a66c5afc602db0427fdbd3a66422819900ba32d0cfe772c50956a79f","source":{"kind":"arxiv","id":"1602.02002","version":1},"attestation_state":"computed","paper":{"title":"The Structure of $W_4$-Immersion-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Archontia Giannopoulou, Daniel Lokshtanov, Dimitrios M. Thilikos, R\\'emy Belmonte","submitted_at":"2016-02-05T12:34:10Z","abstract_excerpt":"We study the structure of graphs that do not contain the wheel on 5 vertices W4 as an immersion, and show that these graphs can be constructed via 1, 2, and 3-edge-sums from subcubic graphs and graphs of bounded treewidth."},"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.02002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-05T12:34:10Z","cross_cats_sorted":[],"title_canon_sha256":"197ee3dbdf189116c06e6c64923fd79109db24c7d12576280baf568cb45509f8","abstract_canon_sha256":"0001f2f6d81d38986d5c07b63853073d7f34b6e750aaf31d2ed69438ea1977e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:14.821383Z","signature_b64":"KQdAW8F8iLQ7dMVaNpguo0RqKpE6X772M9DFrJzjiiMoeeNNde93PdVW+Buk9LM9OdpNMt5tVKOfrcRQK2XKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89c7c034a66c5afc602db0427fdbd3a66422819900ba32d0cfe772c50956a79f","last_reissued_at":"2026-05-18T01:21:14.820762Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:14.820762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Structure of $W_4$-Immersion-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Archontia Giannopoulou, Daniel Lokshtanov, Dimitrios M. Thilikos, R\\'emy Belmonte","submitted_at":"2016-02-05T12:34:10Z","abstract_excerpt":"We study the structure of graphs that do not contain the wheel on 5 vertices W4 as an immersion, and show that these graphs can be constructed via 1, 2, and 3-edge-sums from subcubic graphs and graphs of bounded treewidth."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02002","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.02002","created_at":"2026-05-18T01:21:14.820866+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.02002v1","created_at":"2026-05-18T01:21:14.820866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02002","created_at":"2026-05-18T01:21:14.820866+00:00"},{"alias_kind":"pith_short_12","alias_value":"RHD4ANFGNRNP","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RHD4ANFGNRNPYYBN","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RHD4ANFG","created_at":"2026-05-18T12:30:41.710351+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/RHD4ANFGNRNPYYBNWBBH7W6TUZ","json":"https://pith.science/pith/RHD4ANFGNRNPYYBNWBBH7W6TUZ.json","graph_json":"https://pith.science/api/pith-number/RHD4ANFGNRNPYYBNWBBH7W6TUZ/graph.json","events_json":"https://pith.science/api/pith-number/RHD4ANFGNRNPYYBNWBBH7W6TUZ/events.json","paper":"https://pith.science/paper/RHD4ANFG"},"agent_actions":{"view_html":"https://pith.science/pith/RHD4ANFGNRNPYYBNWBBH7W6TUZ","download_json":"https://pith.science/pith/RHD4ANFGNRNPYYBNWBBH7W6TUZ.json","view_paper":"https://pith.science/paper/RHD4ANFG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.02002&json=true","fetch_graph":"https://pith.science/api/pith-number/RHD4ANFGNRNPYYBNWBBH7W6TUZ/graph.json","fetch_events":"https://pith.science/api/pith-number/RHD4ANFGNRNPYYBNWBBH7W6TUZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RHD4ANFGNRNPYYBNWBBH7W6TUZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RHD4ANFGNRNPYYBNWBBH7W6TUZ/action/storage_attestation","attest_author":"https://pith.science/pith/RHD4ANFGNRNPYYBNWBBH7W6TUZ/action/author_attestation","sign_citation":"https://pith.science/pith/RHD4ANFGNRNPYYBNWBBH7W6TUZ/action/citation_signature","submit_replication":"https://pith.science/pith/RHD4ANFGNRNPYYBNWBBH7W6TUZ/action/replication_record"}},"created_at":"2026-05-18T01:21:14.820866+00:00","updated_at":"2026-05-18T01:21:14.820866+00:00"}