{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PWKZIGPOJHZLJVMAZH6GBTLFM4","short_pith_number":"pith:PWKZIGPO","schema_version":"1.0","canonical_sha256":"7d959419ee49f2b4d580c9fc60cd656707ed58f3a8214cfb8f6e8965791cde92","source":{"kind":"arxiv","id":"1705.01224","version":2},"attestation_state":"computed","paper":{"title":"Topological containment of the 5-clique minus an edge in 4-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Graham Farr, Rebecca Robinson","submitted_at":"2017-05-03T01:37:33Z","abstract_excerpt":"The topological containment problem is known to be polynomial-time solvable for any fixed pattern graph $H$, but good characterisations have been found for only a handful of non-trivial pattern graphs. The complete graph on five vertices, $K_5$, is one pattern graph for which a characterisation has not been found. The discovery of such a characterisation would be of particular interest, due to the Haj\\'os Conjecture. One step towards this may be to find a good characterisation of graphs that do not topologically contain the simpler pattern graph $K_5^-$, obtained by removing a single edge from"},"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":"1705.01224","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-03T01:37:33Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f5a04df44ff2d2a691c61a5aede38ea7d9118796fc59ec58de0d513a54949e5c","abstract_canon_sha256":"aea049ac715899f9e5e06ae8c6df3880a4870d65a6b51ccd40429c21194efb30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:04.674929Z","signature_b64":"EpNhfObZEnVZAMAR4QTaXnbRQL5WGwd3RebHc6oheCBCfbLy6Bk2O+EJTwNNu5IgQMvZDDqUYRx+K6gEJ/RIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d959419ee49f2b4d580c9fc60cd656707ed58f3a8214cfb8f6e8965791cde92","last_reissued_at":"2026-05-18T00:45:04.674520Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:04.674520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Topological containment of the 5-clique minus an edge in 4-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Graham Farr, Rebecca Robinson","submitted_at":"2017-05-03T01:37:33Z","abstract_excerpt":"The topological containment problem is known to be polynomial-time solvable for any fixed pattern graph $H$, but good characterisations have been found for only a handful of non-trivial pattern graphs. The complete graph on five vertices, $K_5$, is one pattern graph for which a characterisation has not been found. The discovery of such a characterisation would be of particular interest, due to the Haj\\'os Conjecture. One step towards this may be to find a good characterisation of graphs that do not topologically contain the simpler pattern graph $K_5^-$, obtained by removing a single edge from"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01224","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":"1705.01224","created_at":"2026-05-18T00:45:04.674596+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.01224v2","created_at":"2026-05-18T00:45:04.674596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01224","created_at":"2026-05-18T00:45:04.674596+00:00"},{"alias_kind":"pith_short_12","alias_value":"PWKZIGPOJHZL","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PWKZIGPOJHZLJVMA","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PWKZIGPO","created_at":"2026-05-18T12:31:37.085036+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/PWKZIGPOJHZLJVMAZH6GBTLFM4","json":"https://pith.science/pith/PWKZIGPOJHZLJVMAZH6GBTLFM4.json","graph_json":"https://pith.science/api/pith-number/PWKZIGPOJHZLJVMAZH6GBTLFM4/graph.json","events_json":"https://pith.science/api/pith-number/PWKZIGPOJHZLJVMAZH6GBTLFM4/events.json","paper":"https://pith.science/paper/PWKZIGPO"},"agent_actions":{"view_html":"https://pith.science/pith/PWKZIGPOJHZLJVMAZH6GBTLFM4","download_json":"https://pith.science/pith/PWKZIGPOJHZLJVMAZH6GBTLFM4.json","view_paper":"https://pith.science/paper/PWKZIGPO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.01224&json=true","fetch_graph":"https://pith.science/api/pith-number/PWKZIGPOJHZLJVMAZH6GBTLFM4/graph.json","fetch_events":"https://pith.science/api/pith-number/PWKZIGPOJHZLJVMAZH6GBTLFM4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PWKZIGPOJHZLJVMAZH6GBTLFM4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PWKZIGPOJHZLJVMAZH6GBTLFM4/action/storage_attestation","attest_author":"https://pith.science/pith/PWKZIGPOJHZLJVMAZH6GBTLFM4/action/author_attestation","sign_citation":"https://pith.science/pith/PWKZIGPOJHZLJVMAZH6GBTLFM4/action/citation_signature","submit_replication":"https://pith.science/pith/PWKZIGPOJHZLJVMAZH6GBTLFM4/action/replication_record"}},"created_at":"2026-05-18T00:45:04.674596+00:00","updated_at":"2026-05-18T00:45:04.674596+00:00"}