{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BVMOJPQDFGVZQRPJ6RJAQ2YKMM","short_pith_number":"pith:BVMOJPQD","canonical_record":{"source":{"id":"1806.06564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-18T09:17:33Z","cross_cats_sorted":[],"title_canon_sha256":"c68c41b683c3fa4a9fe4238b71eed705592c8f60f83e750060bda39dd2eb556e","abstract_canon_sha256":"6e1307a27c44a59bd58a419578a004a03f792f28483dcf8e5b44ac376ebe2c3a"},"schema_version":"1.0"},"canonical_sha256":"0d58e4be0329ab9845e9f452086b0a6334d91c913ebab54a5a508f1324c522eb","source":{"kind":"arxiv","id":"1806.06564","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06564","created_at":"2026-05-18T00:13:01Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06564v1","created_at":"2026-05-18T00:13:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06564","created_at":"2026-05-18T00:13:01Z"},{"alias_kind":"pith_short_12","alias_value":"BVMOJPQDFGVZ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BVMOJPQDFGVZQRPJ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BVMOJPQD","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BVMOJPQDFGVZQRPJ6RJAQ2YKMM","target":"record","payload":{"canonical_record":{"source":{"id":"1806.06564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-18T09:17:33Z","cross_cats_sorted":[],"title_canon_sha256":"c68c41b683c3fa4a9fe4238b71eed705592c8f60f83e750060bda39dd2eb556e","abstract_canon_sha256":"6e1307a27c44a59bd58a419578a004a03f792f28483dcf8e5b44ac376ebe2c3a"},"schema_version":"1.0"},"canonical_sha256":"0d58e4be0329ab9845e9f452086b0a6334d91c913ebab54a5a508f1324c522eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:01.974665Z","signature_b64":"G10mDt6w7NEYe/P+XVxJ/7fqXcDRdteh0QpsWjw8jA8HxgAHD6Bo0nF3eJUtKP1Rv0vnia8vlwTHx9e77c0gCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d58e4be0329ab9845e9f452086b0a6334d91c913ebab54a5a508f1324c522eb","last_reissued_at":"2026-05-18T00:13:01.973979Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:01.973979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.06564","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-18T00:13:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jGUolfElSOdzW9aVKI8JVEf+kqUVVcob2F8RG5I13P67ymcIPhCKsuAa7v0qdc+G+JN4ylU3Ert5LVsrgVOFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:52:32.110592Z"},"content_sha256":"c4a695735af25258bfbeb2711e4fe6e942db2aa02cae30e89796ca35f6eff38f","schema_version":"1.0","event_id":"sha256:c4a695735af25258bfbeb2711e4fe6e942db2aa02cae30e89796ca35f6eff38f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BVMOJPQDFGVZQRPJ6RJAQ2YKMM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Detour-saturated graphs of small girths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pu Qiao, Xingzhi Zhan","submitted_at":"2018-06-18T09:17:33Z","abstract_excerpt":"A detour of a graph G is a longest path in G. The detour order of G is the number of vertices in a detour of G. A graph is said to be detour-saturated if the addition of any edge increases strictly the detour order. L.W. Beineke, J.E. Dunbar and M. Frick asked the following three questions in 2005. (1) What is the smallest order of a detour-saturated graph of girth 4? (2) Let Pr be the graph obtained from the Petersen graph by splitting one of its vertices into three leaves. Is Pr the smallest triangle-free detour-saturated graph? (3) Does there exist a detour-saturated graph with finite girth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06564","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-18T00:13:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Km+gLJApoeUy3e8c9PpZL9FNtaZZiz01b62H/xQOcZfRZ1crK34FeW+fvsidR+NX4a4OTDu2RapHPD7+x7JzAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:52:32.110940Z"},"content_sha256":"260e6d74169716e0ce9a08fc465703a41063a7992372505f83d3804631a82a49","schema_version":"1.0","event_id":"sha256:260e6d74169716e0ce9a08fc465703a41063a7992372505f83d3804631a82a49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BVMOJPQDFGVZQRPJ6RJAQ2YKMM/bundle.json","state_url":"https://pith.science/pith/BVMOJPQDFGVZQRPJ6RJAQ2YKMM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BVMOJPQDFGVZQRPJ6RJAQ2YKMM/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-26T01:52:32Z","links":{"resolver":"https://pith.science/pith/BVMOJPQDFGVZQRPJ6RJAQ2YKMM","bundle":"https://pith.science/pith/BVMOJPQDFGVZQRPJ6RJAQ2YKMM/bundle.json","state":"https://pith.science/pith/BVMOJPQDFGVZQRPJ6RJAQ2YKMM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BVMOJPQDFGVZQRPJ6RJAQ2YKMM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BVMOJPQDFGVZQRPJ6RJAQ2YKMM","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":"6e1307a27c44a59bd58a419578a004a03f792f28483dcf8e5b44ac376ebe2c3a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-18T09:17:33Z","title_canon_sha256":"c68c41b683c3fa4a9fe4238b71eed705592c8f60f83e750060bda39dd2eb556e"},"schema_version":"1.0","source":{"id":"1806.06564","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06564","created_at":"2026-05-18T00:13:01Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06564v1","created_at":"2026-05-18T00:13:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06564","created_at":"2026-05-18T00:13:01Z"},{"alias_kind":"pith_short_12","alias_value":"BVMOJPQDFGVZ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BVMOJPQDFGVZQRPJ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BVMOJPQD","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:260e6d74169716e0ce9a08fc465703a41063a7992372505f83d3804631a82a49","target":"graph","created_at":"2026-05-18T00:13:01Z","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":"A detour of a graph G is a longest path in G. The detour order of G is the number of vertices in a detour of G. A graph is said to be detour-saturated if the addition of any edge increases strictly the detour order. L.W. Beineke, J.E. Dunbar and M. Frick asked the following three questions in 2005. (1) What is the smallest order of a detour-saturated graph of girth 4? (2) Let Pr be the graph obtained from the Petersen graph by splitting one of its vertices into three leaves. Is Pr the smallest triangle-free detour-saturated graph? (3) Does there exist a detour-saturated graph with finite girth","authors_text":"Pu Qiao, Xingzhi Zhan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-18T09:17:33Z","title":"Detour-saturated graphs of small girths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06564","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:c4a695735af25258bfbeb2711e4fe6e942db2aa02cae30e89796ca35f6eff38f","target":"record","created_at":"2026-05-18T00:13:01Z","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":"6e1307a27c44a59bd58a419578a004a03f792f28483dcf8e5b44ac376ebe2c3a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-18T09:17:33Z","title_canon_sha256":"c68c41b683c3fa4a9fe4238b71eed705592c8f60f83e750060bda39dd2eb556e"},"schema_version":"1.0","source":{"id":"1806.06564","kind":"arxiv","version":1}},"canonical_sha256":"0d58e4be0329ab9845e9f452086b0a6334d91c913ebab54a5a508f1324c522eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d58e4be0329ab9845e9f452086b0a6334d91c913ebab54a5a508f1324c522eb","first_computed_at":"2026-05-18T00:13:01.973979Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:01.973979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G10mDt6w7NEYe/P+XVxJ/7fqXcDRdteh0QpsWjw8jA8HxgAHD6Bo0nF3eJUtKP1Rv0vnia8vlwTHx9e77c0gCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:01.974665Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.06564","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4a695735af25258bfbeb2711e4fe6e942db2aa02cae30e89796ca35f6eff38f","sha256:260e6d74169716e0ce9a08fc465703a41063a7992372505f83d3804631a82a49"],"state_sha256":"17e4d85c53964b597bf9a4c69344fcb7bef938f487a861edb3fc27e53ca7e4df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"foiwyWJ9cFiPh7pTzOiTIvqTUtFJ5p9A2ZWKmlgJHI2XOeoqwHS26WOzrW+DOIvV3fP8Vg+FYj63P2/pdhluAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T01:52:32.113072Z","bundle_sha256":"f2450b58999c0e61fcb8fdcf113db65a615771b5a32ee78ca3a3c2fe0fe67d21"}}