{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UB2JPQBCNZWLFLULNTSJXGHBFY","short_pith_number":"pith:UB2JPQBC","canonical_record":{"source":{"id":"1902.10344","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-27T06:12:08Z","cross_cats_sorted":[],"title_canon_sha256":"9f3d2798c5eb314a759199c02baa6b5f8558666d4a6ec589c22b301ea0a853b4","abstract_canon_sha256":"03a8bd74c79f4f2d12c0ed9cd66d23cc2bacd5c7efcda13c5fada38bb722929a"},"schema_version":"1.0"},"canonical_sha256":"a07497c0226e6cb2ae8b6ce49b98e12e20711d490cfbd33335db9d430de66e5a","source":{"kind":"arxiv","id":"1902.10344","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10344","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10344v1","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10344","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"pith_short_12","alias_value":"UB2JPQBCNZWL","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UB2JPQBCNZWLFLUL","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UB2JPQBC","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UB2JPQBCNZWLFLULNTSJXGHBFY","target":"record","payload":{"canonical_record":{"source":{"id":"1902.10344","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-27T06:12:08Z","cross_cats_sorted":[],"title_canon_sha256":"9f3d2798c5eb314a759199c02baa6b5f8558666d4a6ec589c22b301ea0a853b4","abstract_canon_sha256":"03a8bd74c79f4f2d12c0ed9cd66d23cc2bacd5c7efcda13c5fada38bb722929a"},"schema_version":"1.0"},"canonical_sha256":"a07497c0226e6cb2ae8b6ce49b98e12e20711d490cfbd33335db9d430de66e5a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:31.135492Z","signature_b64":"vVi1ERqgzqwx+/zs7rPQQrqjXgob3eSQufMEoDy6jm7/952zwWkm9+PfH7r8KSzHzLhPysIi1LbUP8FOO2ehBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a07497c0226e6cb2ae8b6ce49b98e12e20711d490cfbd33335db9d430de66e5a","last_reissued_at":"2026-05-17T23:52:31.134960Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:31.134960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.10344","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-17T23:52:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TmRjyWN02s2Tb/xcVKMXJdB7DujKID6VcwNtTCTgdbwbPg+xwq8ypF+ehm2wqeGbRpYSdn8Li/yKGO/+bxCTAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:10:36.536280Z"},"content_sha256":"bef59b76fa8e66d9308fba3dcd2b1cc89eef07c835bf814d60d7c59096f6b418","schema_version":"1.0","event_id":"sha256:bef59b76fa8e66d9308fba3dcd2b1cc89eef07c835bf814d60d7c59096f6b418"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UB2JPQBCNZWLFLULNTSJXGHBFY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Hamiltonian 3-Regular Graphs with Arbitrary Girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Haythorpe","submitted_at":"2019-02-27T06:12:08Z","abstract_excerpt":"It is well known that 3--regular graphs with arbitrarily large girth exist. Three constructions are given that use the former to produce non-Hamiltonian 3--regular graphs without reducing the girth, thereby proving that such graphs with arbitrarily large girth also exist. The resulting graphs can be 1--, 2-- or 3--edge-connected depending on the construction chosen. From the constructions arise (naive) upper bounds on the size of the smallest non-Hamiltonian 3--regular graphs with particular girth. Several examples are given of the smallest such graphs for various choices of girth and connecte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10344","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-17T23:52:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MuMbDHGMG6V24JuL+tjMNKXtUoyM+r4S6rLXhDqgnRxlOfSbj38lqcqMmA18UM2h0zpcMQ9kJpi1qbZlAxDYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:10:36.536930Z"},"content_sha256":"3ec834f111494dcc4a17282ac134c38bc089f3da307c11b1b6c8cb01c5ba30d9","schema_version":"1.0","event_id":"sha256:3ec834f111494dcc4a17282ac134c38bc089f3da307c11b1b6c8cb01c5ba30d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UB2JPQBCNZWLFLULNTSJXGHBFY/bundle.json","state_url":"https://pith.science/pith/UB2JPQBCNZWLFLULNTSJXGHBFY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UB2JPQBCNZWLFLULNTSJXGHBFY/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-05-31T05:10:36Z","links":{"resolver":"https://pith.science/pith/UB2JPQBCNZWLFLULNTSJXGHBFY","bundle":"https://pith.science/pith/UB2JPQBCNZWLFLULNTSJXGHBFY/bundle.json","state":"https://pith.science/pith/UB2JPQBCNZWLFLULNTSJXGHBFY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UB2JPQBCNZWLFLULNTSJXGHBFY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UB2JPQBCNZWLFLULNTSJXGHBFY","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":"03a8bd74c79f4f2d12c0ed9cd66d23cc2bacd5c7efcda13c5fada38bb722929a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-27T06:12:08Z","title_canon_sha256":"9f3d2798c5eb314a759199c02baa6b5f8558666d4a6ec589c22b301ea0a853b4"},"schema_version":"1.0","source":{"id":"1902.10344","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10344","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10344v1","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10344","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"pith_short_12","alias_value":"UB2JPQBCNZWL","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UB2JPQBCNZWLFLUL","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UB2JPQBC","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:3ec834f111494dcc4a17282ac134c38bc089f3da307c11b1b6c8cb01c5ba30d9","target":"graph","created_at":"2026-05-17T23:52:31Z","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":"It is well known that 3--regular graphs with arbitrarily large girth exist. Three constructions are given that use the former to produce non-Hamiltonian 3--regular graphs without reducing the girth, thereby proving that such graphs with arbitrarily large girth also exist. The resulting graphs can be 1--, 2-- or 3--edge-connected depending on the construction chosen. From the constructions arise (naive) upper bounds on the size of the smallest non-Hamiltonian 3--regular graphs with particular girth. Several examples are given of the smallest such graphs for various choices of girth and connecte","authors_text":"Michael Haythorpe","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-27T06:12:08Z","title":"Non-Hamiltonian 3-Regular Graphs with Arbitrary Girth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10344","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:bef59b76fa8e66d9308fba3dcd2b1cc89eef07c835bf814d60d7c59096f6b418","target":"record","created_at":"2026-05-17T23:52:31Z","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":"03a8bd74c79f4f2d12c0ed9cd66d23cc2bacd5c7efcda13c5fada38bb722929a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-27T06:12:08Z","title_canon_sha256":"9f3d2798c5eb314a759199c02baa6b5f8558666d4a6ec589c22b301ea0a853b4"},"schema_version":"1.0","source":{"id":"1902.10344","kind":"arxiv","version":1}},"canonical_sha256":"a07497c0226e6cb2ae8b6ce49b98e12e20711d490cfbd33335db9d430de66e5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a07497c0226e6cb2ae8b6ce49b98e12e20711d490cfbd33335db9d430de66e5a","first_computed_at":"2026-05-17T23:52:31.134960Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:31.134960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vVi1ERqgzqwx+/zs7rPQQrqjXgob3eSQufMEoDy6jm7/952zwWkm9+PfH7r8KSzHzLhPysIi1LbUP8FOO2ehBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:31.135492Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.10344","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bef59b76fa8e66d9308fba3dcd2b1cc89eef07c835bf814d60d7c59096f6b418","sha256:3ec834f111494dcc4a17282ac134c38bc089f3da307c11b1b6c8cb01c5ba30d9"],"state_sha256":"ddccb0ed4c82c872de448ec55e08cdccc0f70882b5e2247ea5f035d7f3fbf8a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GSR76yIHbgXXJ69uM85PNUL/U03ofbi6jfPB6G83rqaEZI9EXX4mQ/MWvzCJfgMqot5Hyb+AtcCYeQLD+euuAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:10:36.539807Z","bundle_sha256":"1a5ac1a38ea668a30b836d461307206158eef06eda2daa523a8bc0c115df0555"}}