{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XNBOBMBPBDZVZSTP3TLGQUDWZV","short_pith_number":"pith:XNBOBMBP","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"},"canonical_sha256":"bb42e0b02f08f35cca6fdcd6685076cd52bbbd0bbeb857f968bb8cd1afbaf943","source":{"kind":"arxiv","id":"1404.5757","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5757","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5757v1","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5757","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"pith_short_12","alias_value":"XNBOBMBPBDZV","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XNBOBMBPBDZVZSTP","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XNBOBMBP","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XNBOBMBPBDZVZSTP3TLGQUDWZV","target":"record","payload":{"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"},"canonical_sha256":"bb42e0b02f08f35cca6fdcd6685076cd52bbbd0bbeb857f968bb8cd1afbaf943","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"},"source_kind":"arxiv","source_id":"1404.5757","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-18T02:53:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UvIF8W52nk/NtAEUMkwRH9IZ9W8kUDme+hzZ3JKrAq14lrbn+uk7N7P0umBpLQt92nxb1W7av4zDGnKJop+RBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:35:31.500404Z"},"content_sha256":"885dec64d8af5439e7c0856e8eabd4e619f57e60ffa659fbabac2177612c02d8","schema_version":"1.0","event_id":"sha256:885dec64d8af5439e7c0856e8eabd4e619f57e60ffa659fbabac2177612c02d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XNBOBMBPBDZVZSTP3TLGQUDWZV","target":"graph","payload":{"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"},"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-18T02:53:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r8c/kVlcvS7U5MQipIY2+gXj47XIRtgPsaJy1zOs0zlL3kJCtuW8babM1bBO+7TzVv7s1Skm5q3ISnt8GJfGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:35:31.500871Z"},"content_sha256":"4ed27059a53b52e2ac14cea3699fac2b2a8a6f809b7a3db90d9eb579cbc519c4","schema_version":"1.0","event_id":"sha256:4ed27059a53b52e2ac14cea3699fac2b2a8a6f809b7a3db90d9eb579cbc519c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XNBOBMBPBDZVZSTP3TLGQUDWZV/bundle.json","state_url":"https://pith.science/pith/XNBOBMBPBDZVZSTP3TLGQUDWZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XNBOBMBPBDZVZSTP3TLGQUDWZV/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-06-25T07:35:31Z","links":{"resolver":"https://pith.science/pith/XNBOBMBPBDZVZSTP3TLGQUDWZV","bundle":"https://pith.science/pith/XNBOBMBPBDZVZSTP3TLGQUDWZV/bundle.json","state":"https://pith.science/pith/XNBOBMBPBDZVZSTP3TLGQUDWZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XNBOBMBPBDZVZSTP3TLGQUDWZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XNBOBMBPBDZVZSTP3TLGQUDWZV","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":"3abb0b79e7e4247d76b08a092fb4246e4e0ae7bc3cb8cf38c3ee15b258cd8aa2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-23T09:22:57Z","title_canon_sha256":"cb1937eb552a6d41fcd20b45124821d61bdfbeb0e468367f2c6f26400c8ce3cc"},"schema_version":"1.0","source":{"id":"1404.5757","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5757","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5757v1","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5757","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"pith_short_12","alias_value":"XNBOBMBPBDZV","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XNBOBMBPBDZVZSTP","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XNBOBMBP","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:4ed27059a53b52e2ac14cea3699fac2b2a8a6f809b7a3db90d9eb579cbc519c4","target":"graph","created_at":"2026-05-18T02:53: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":"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.","authors_text":"Gregory Cherlin, Saharon Shelah","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-23T09:22:57Z","title":"Universal graphs with a forbidden subgraph: Block path solidity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5757","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:885dec64d8af5439e7c0856e8eabd4e619f57e60ffa659fbabac2177612c02d8","target":"record","created_at":"2026-05-18T02:53: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":"3abb0b79e7e4247d76b08a092fb4246e4e0ae7bc3cb8cf38c3ee15b258cd8aa2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-23T09:22:57Z","title_canon_sha256":"cb1937eb552a6d41fcd20b45124821d61bdfbeb0e468367f2c6f26400c8ce3cc"},"schema_version":"1.0","source":{"id":"1404.5757","kind":"arxiv","version":1}},"canonical_sha256":"bb42e0b02f08f35cca6fdcd6685076cd52bbbd0bbeb857f968bb8cd1afbaf943","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb42e0b02f08f35cca6fdcd6685076cd52bbbd0bbeb857f968bb8cd1afbaf943","first_computed_at":"2026-05-18T02:53:28.017409Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:28.017409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zt/z3WUBcqLvr14PLYcOXORLPA6BdYFKarQ9vvvMFL0DZ0AK6IzhJFE1zx3vOkWHemKezYabf1SEgFIYvGOzAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:28.018156Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5757","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:885dec64d8af5439e7c0856e8eabd4e619f57e60ffa659fbabac2177612c02d8","sha256:4ed27059a53b52e2ac14cea3699fac2b2a8a6f809b7a3db90d9eb579cbc519c4"],"state_sha256":"4c72a755e4a7925e77ac17acce52e3fbc479c3bd91cf9e287655edf200eed695"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZtVUNdFO7d1tq2fR2f5BORVNUs+5yEizwwcnlOTtQmh3KKCL7/GBhyNNDRX3eDaUKhqv2a1BZcBEn6YJFyYMAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T07:35:31.503396Z","bundle_sha256":"99068fe560e5543c0a0c1eb67048a79b10c67ef48ed78b1e8c915e3f4a3f1586"}}