{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:H3YBA6Y4M3QW6VHPOWYN47X26H","short_pith_number":"pith:H3YBA6Y4","canonical_record":{"source":{"id":"1903.02508","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-03-06T17:32:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2d283ef6869e1265ef91917e3e6ee0e7a358f6e9cecbdaee402577217feb1971","abstract_canon_sha256":"9c09d6f4184a6e3474a884d3379c1b74f1bef89b97031c8fc80cbc8acbecc3c5"},"schema_version":"1.0"},"canonical_sha256":"3ef0107b1c66e16f54ef75b0de7efaf1c079346073032ad905e2ea34382d77e9","source":{"kind":"arxiv","id":"1903.02508","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02508","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02508v1","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02508","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"pith_short_12","alias_value":"H3YBA6Y4M3QW","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"H3YBA6Y4M3QW6VHP","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"H3YBA6Y4","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:H3YBA6Y4M3QW6VHPOWYN47X26H","target":"record","payload":{"canonical_record":{"source":{"id":"1903.02508","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-03-06T17:32:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2d283ef6869e1265ef91917e3e6ee0e7a358f6e9cecbdaee402577217feb1971","abstract_canon_sha256":"9c09d6f4184a6e3474a884d3379c1b74f1bef89b97031c8fc80cbc8acbecc3c5"},"schema_version":"1.0"},"canonical_sha256":"3ef0107b1c66e16f54ef75b0de7efaf1c079346073032ad905e2ea34382d77e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:55.201171Z","signature_b64":"wXzje7Nu0tdMWQk5zBL1eXMyFkUuO+cbt498JKMNR1+9w61V6uScaOKwiuvBl7G7+6czt9PGvK8SuZAMr6GJAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ef0107b1c66e16f54ef75b0de7efaf1c079346073032ad905e2ea34382d77e9","last_reissued_at":"2026-05-17T23:51:55.200769Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:55.200769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.02508","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:51:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6eoY5uzJG6SEJU05Etp+WP6uowELeRdikAskgaIdhGma2Cce9sglFZJrd8gR50wYKfqbORBvORvJoNTqAACcAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T20:07:00.974978Z"},"content_sha256":"e05ae3dbbb6f0ef7f28cff8d36bc8504622cc2e455a063e9a2038154c7cce5cd","schema_version":"1.0","event_id":"sha256:e05ae3dbbb6f0ef7f28cff8d36bc8504622cc2e455a063e9a2038154c7cce5cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:H3YBA6Y4M3QW6VHPOWYN47X26H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Longest paths in 2-edge-connected cubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Eldar Fischer, Felix Reidl, Nikola K. Blanchard, Oded Lachish","submitted_at":"2019-03-06T17:32:56Z","abstract_excerpt":"We prove almost tight bounds on the length of paths in $2$-edge-connected cubic graphs. Concretely, we show that (i) every $2$-edge-connected cubic graph of size $n$ has a path of length $\\Omega\\left(\\frac{\\log^2{n}}{\\log{\\log{n}}}\\right)$, and (ii) there exists a $2$-edge-connected cubic graph, such that every path in the graph has length $O(\\log^2{n})$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02508","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:51:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"97qa12NOZFep0SmkYvtabRatDv3xJdYwB3mrt4GXTNLQ+oOdsX3xMwvOVe+iKG6wEh2NNLdoQUK0b8aev2bECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T20:07:00.975336Z"},"content_sha256":"156d784f16bb79014d6156aa63be322838794c69577d6fe24270d9fae59fab7a","schema_version":"1.0","event_id":"sha256:156d784f16bb79014d6156aa63be322838794c69577d6fe24270d9fae59fab7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H3YBA6Y4M3QW6VHPOWYN47X26H/bundle.json","state_url":"https://pith.science/pith/H3YBA6Y4M3QW6VHPOWYN47X26H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H3YBA6Y4M3QW6VHPOWYN47X26H/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-07-03T20:07:00Z","links":{"resolver":"https://pith.science/pith/H3YBA6Y4M3QW6VHPOWYN47X26H","bundle":"https://pith.science/pith/H3YBA6Y4M3QW6VHPOWYN47X26H/bundle.json","state":"https://pith.science/pith/H3YBA6Y4M3QW6VHPOWYN47X26H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H3YBA6Y4M3QW6VHPOWYN47X26H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:H3YBA6Y4M3QW6VHPOWYN47X26H","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":"9c09d6f4184a6e3474a884d3379c1b74f1bef89b97031c8fc80cbc8acbecc3c5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-03-06T17:32:56Z","title_canon_sha256":"2d283ef6869e1265ef91917e3e6ee0e7a358f6e9cecbdaee402577217feb1971"},"schema_version":"1.0","source":{"id":"1903.02508","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02508","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02508v1","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02508","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"pith_short_12","alias_value":"H3YBA6Y4M3QW","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"H3YBA6Y4M3QW6VHP","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"H3YBA6Y4","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:156d784f16bb79014d6156aa63be322838794c69577d6fe24270d9fae59fab7a","target":"graph","created_at":"2026-05-17T23:51:55Z","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":"We prove almost tight bounds on the length of paths in $2$-edge-connected cubic graphs. Concretely, we show that (i) every $2$-edge-connected cubic graph of size $n$ has a path of length $\\Omega\\left(\\frac{\\log^2{n}}{\\log{\\log{n}}}\\right)$, and (ii) there exists a $2$-edge-connected cubic graph, such that every path in the graph has length $O(\\log^2{n})$.","authors_text":"Eldar Fischer, Felix Reidl, Nikola K. Blanchard, Oded Lachish","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-03-06T17:32:56Z","title":"Longest paths in 2-edge-connected cubic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02508","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:e05ae3dbbb6f0ef7f28cff8d36bc8504622cc2e455a063e9a2038154c7cce5cd","target":"record","created_at":"2026-05-17T23:51:55Z","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":"9c09d6f4184a6e3474a884d3379c1b74f1bef89b97031c8fc80cbc8acbecc3c5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-03-06T17:32:56Z","title_canon_sha256":"2d283ef6869e1265ef91917e3e6ee0e7a358f6e9cecbdaee402577217feb1971"},"schema_version":"1.0","source":{"id":"1903.02508","kind":"arxiv","version":1}},"canonical_sha256":"3ef0107b1c66e16f54ef75b0de7efaf1c079346073032ad905e2ea34382d77e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ef0107b1c66e16f54ef75b0de7efaf1c079346073032ad905e2ea34382d77e9","first_computed_at":"2026-05-17T23:51:55.200769Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:55.200769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wXzje7Nu0tdMWQk5zBL1eXMyFkUuO+cbt498JKMNR1+9w61V6uScaOKwiuvBl7G7+6czt9PGvK8SuZAMr6GJAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:55.201171Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.02508","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e05ae3dbbb6f0ef7f28cff8d36bc8504622cc2e455a063e9a2038154c7cce5cd","sha256:156d784f16bb79014d6156aa63be322838794c69577d6fe24270d9fae59fab7a"],"state_sha256":"9290281b8c57c424487d4e082fb7510f50253a9c6cd9c9c455c95dfa57fdab46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7E3RFiDNUI8nMLmZe6r1dbsJmA50i15P63viu9CoEommmTzPzDPYo20LtI8fqEelksnVrKvCflH69XH03wSKCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T20:07:00.977150Z","bundle_sha256":"6401f818175b48759f0f75a4c38ba145a7781d43e17f69606ca0776d8df457cc"}}