{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:H3YBA6Y4M3QW6VHPOWYN47X26H","short_pith_number":"pith:H3YBA6Y4","schema_version":"1.0","canonical_sha256":"3ef0107b1c66e16f54ef75b0de7efaf1c079346073032ad905e2ea34382d77e9","source":{"kind":"arxiv","id":"1903.02508","version":1},"attestation_state":"computed","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})$."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.02508","created_at":"2026-05-17T23:51:55.200830+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.02508v1","created_at":"2026-05-17T23:51:55.200830+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02508","created_at":"2026-05-17T23:51:55.200830+00:00"},{"alias_kind":"pith_short_12","alias_value":"H3YBA6Y4M3QW","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"H3YBA6Y4M3QW6VHP","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"H3YBA6Y4","created_at":"2026-05-18T12:33:18.533446+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/H3YBA6Y4M3QW6VHPOWYN47X26H","json":"https://pith.science/pith/H3YBA6Y4M3QW6VHPOWYN47X26H.json","graph_json":"https://pith.science/api/pith-number/H3YBA6Y4M3QW6VHPOWYN47X26H/graph.json","events_json":"https://pith.science/api/pith-number/H3YBA6Y4M3QW6VHPOWYN47X26H/events.json","paper":"https://pith.science/paper/H3YBA6Y4"},"agent_actions":{"view_html":"https://pith.science/pith/H3YBA6Y4M3QW6VHPOWYN47X26H","download_json":"https://pith.science/pith/H3YBA6Y4M3QW6VHPOWYN47X26H.json","view_paper":"https://pith.science/paper/H3YBA6Y4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.02508&json=true","fetch_graph":"https://pith.science/api/pith-number/H3YBA6Y4M3QW6VHPOWYN47X26H/graph.json","fetch_events":"https://pith.science/api/pith-number/H3YBA6Y4M3QW6VHPOWYN47X26H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H3YBA6Y4M3QW6VHPOWYN47X26H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H3YBA6Y4M3QW6VHPOWYN47X26H/action/storage_attestation","attest_author":"https://pith.science/pith/H3YBA6Y4M3QW6VHPOWYN47X26H/action/author_attestation","sign_citation":"https://pith.science/pith/H3YBA6Y4M3QW6VHPOWYN47X26H/action/citation_signature","submit_replication":"https://pith.science/pith/H3YBA6Y4M3QW6VHPOWYN47X26H/action/replication_record"}},"created_at":"2026-05-17T23:51:55.200830+00:00","updated_at":"2026-05-17T23:51:55.200830+00:00"}