{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XNBOBMBPBDZVZSTP3TLGQUDWZV","short_pith_number":"pith:XNBOBMBP","schema_version":"1.0","canonical_sha256":"bb42e0b02f08f35cca6fdcd6685076cd52bbbd0bbeb857f968bb8cd1afbaf943","source":{"kind":"arxiv","id":"1404.5757","version":1},"attestation_state":"computed","paper":{"title":"Universal graphs with a forbidden subgraph: Block path solidity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gregory Cherlin, Saharon Shelah","submitted_at":"2014-04-23T09:22:57Z","abstract_excerpt":"Let C be a finite connected graph for which there is a countable universal C-free graph, and whose tree of blocks is a path. Then the blocks of C are complete. This generalizes a result of Furedi and Komjath, and fits naturally into a set of conjectures regarding the existence of countable C-free graphs, with C an arbitrary finite connected graph."},"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":"1404.5757","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-23T09:22:57Z","cross_cats_sorted":[],"title_canon_sha256":"cb1937eb552a6d41fcd20b45124821d61bdfbeb0e468367f2c6f26400c8ce3cc","abstract_canon_sha256":"3abb0b79e7e4247d76b08a092fb4246e4e0ae7bc3cb8cf38c3ee15b258cd8aa2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:28.018156Z","signature_b64":"zt/z3WUBcqLvr14PLYcOXORLPA6BdYFKarQ9vvvMFL0DZ0AK6IzhJFE1zx3vOkWHemKezYabf1SEgFIYvGOzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb42e0b02f08f35cca6fdcd6685076cd52bbbd0bbeb857f968bb8cd1afbaf943","last_reissued_at":"2026-05-18T02:53:28.017409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:28.017409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal graphs with a forbidden subgraph: Block path solidity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gregory Cherlin, Saharon Shelah","submitted_at":"2014-04-23T09:22:57Z","abstract_excerpt":"Let C be a finite connected graph for which there is a countable universal C-free graph, and whose tree of blocks is a path. Then the blocks of C are complete. This generalizes a result of Furedi and Komjath, and fits naturally into a set of conjectures regarding the existence of countable C-free graphs, with C an arbitrary finite connected graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5757","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":"1404.5757","created_at":"2026-05-18T02:53:28.017519+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.5757v1","created_at":"2026-05-18T02:53:28.017519+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5757","created_at":"2026-05-18T02:53:28.017519+00:00"},{"alias_kind":"pith_short_12","alias_value":"XNBOBMBPBDZV","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XNBOBMBPBDZVZSTP","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XNBOBMBP","created_at":"2026-05-18T12:28:57.508820+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/XNBOBMBPBDZVZSTP3TLGQUDWZV","json":"https://pith.science/pith/XNBOBMBPBDZVZSTP3TLGQUDWZV.json","graph_json":"https://pith.science/api/pith-number/XNBOBMBPBDZVZSTP3TLGQUDWZV/graph.json","events_json":"https://pith.science/api/pith-number/XNBOBMBPBDZVZSTP3TLGQUDWZV/events.json","paper":"https://pith.science/paper/XNBOBMBP"},"agent_actions":{"view_html":"https://pith.science/pith/XNBOBMBPBDZVZSTP3TLGQUDWZV","download_json":"https://pith.science/pith/XNBOBMBPBDZVZSTP3TLGQUDWZV.json","view_paper":"https://pith.science/paper/XNBOBMBP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.5757&json=true","fetch_graph":"https://pith.science/api/pith-number/XNBOBMBPBDZVZSTP3TLGQUDWZV/graph.json","fetch_events":"https://pith.science/api/pith-number/XNBOBMBPBDZVZSTP3TLGQUDWZV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XNBOBMBPBDZVZSTP3TLGQUDWZV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XNBOBMBPBDZVZSTP3TLGQUDWZV/action/storage_attestation","attest_author":"https://pith.science/pith/XNBOBMBPBDZVZSTP3TLGQUDWZV/action/author_attestation","sign_citation":"https://pith.science/pith/XNBOBMBPBDZVZSTP3TLGQUDWZV/action/citation_signature","submit_replication":"https://pith.science/pith/XNBOBMBPBDZVZSTP3TLGQUDWZV/action/replication_record"}},"created_at":"2026-05-18T02:53:28.017519+00:00","updated_at":"2026-05-18T02:53:28.017519+00:00"}