{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:RUNKPDKIEEVIEBJMN55ZPI5KWT","short_pith_number":"pith:RUNKPDKI","canonical_record":{"source":{"id":"2301.08707","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-01-20T18:04:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"77550087e804d22e9202a7c490667d4223e84abb35b6c10257d5dc16ca46d2f5","abstract_canon_sha256":"b1c411aa2b5ef887c3f660ea83c74efea14a993f05c2e2bdd9f004b9921c17b1"},"schema_version":"1.0"},"canonical_sha256":"8d1aa78d48212a82052c6f7b97a3aab4ecb5d821385b4a78f5e163803938929d","source":{"kind":"arxiv","id":"2301.08707","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.08707","created_at":"2026-07-05T06:58:54Z"},{"alias_kind":"arxiv_version","alias_value":"2301.08707v3","created_at":"2026-07-05T06:58:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.08707","created_at":"2026-07-05T06:58:54Z"},{"alias_kind":"pith_short_12","alias_value":"RUNKPDKIEEVI","created_at":"2026-07-05T06:58:54Z"},{"alias_kind":"pith_short_16","alias_value":"RUNKPDKIEEVIEBJM","created_at":"2026-07-05T06:58:54Z"},{"alias_kind":"pith_short_8","alias_value":"RUNKPDKI","created_at":"2026-07-05T06:58:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:RUNKPDKIEEVIEBJMN55ZPI5KWT","target":"record","payload":{"canonical_record":{"source":{"id":"2301.08707","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-01-20T18:04:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"77550087e804d22e9202a7c490667d4223e84abb35b6c10257d5dc16ca46d2f5","abstract_canon_sha256":"b1c411aa2b5ef887c3f660ea83c74efea14a993f05c2e2bdd9f004b9921c17b1"},"schema_version":"1.0"},"canonical_sha256":"8d1aa78d48212a82052c6f7b97a3aab4ecb5d821385b4a78f5e163803938929d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:58:54.734174Z","signature_b64":"IonasrwPCBD9Rm6oyjTzjZgmI4ir3zAUB7qbj12nkwaUXcUBssrmCK+wAjuHrdMGDz7v3s+/3pvam5GDp9W+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d1aa78d48212a82052c6f7b97a3aab4ecb5d821385b4a78f5e163803938929d","last_reissued_at":"2026-07-05T06:58:54.733705Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:58:54.733705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.08707","source_version":3,"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-07-05T06:58:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vm4GPZqNroYp60GWmDNF+/xhlsgmTPMv6K9VM6Zk4nnXxEW7HpIgNYj2e0CZ319I3Oz0HJewXpO1N2NvIwZ/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T17:09:04.541869Z"},"content_sha256":"5a723cccbe57f86a54c7a51f27b188f3e9f765c52c3b455f57212cb9c9426b87","schema_version":"1.0","event_id":"sha256:5a723cccbe57f86a54c7a51f27b188f3e9f765c52c3b455f57212cb9c9426b87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:RUNKPDKIEEVIEBJMN55ZPI5KWT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Separating the edges of a graph by a linear number of paths","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"F\\'abio Botler, Fran\\c{c}ois Dross, Jozef Skokan, Marthe Bonamy, T\\'assio Naia","submitted_at":"2023-01-20T18:04:53Z","abstract_excerpt":"Recently, Letzter proved that any graph of order $n$ contains a collection $\\mathcal{P}$ of $O(n\\log^\\star n)$ paths with the following property: for all distinct edges $e$ and $f$ there exists a path in $\\mathcal{P}$ which contains $e$ but not $f$. We improve this upper bound to $19 n$, thus answering a question of G.O.H. Katona and confirming a conjecture independently posed by Balogh, Csaba, Martin, and Pluh\\'ar and by Falgas-Ravry, Kittipassorn, Kor\\'andi, Letzter, and Narayanan. Our proof is elementary and self-contained."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.08707","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2301.08707/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:58:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fwPedchVADxZXFGT0diIgSju0BabLDj800xV71Ez1lAOWus9/Np8LFCrI+X0MvFf2VBTybQj6VwhC3qilVWVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T17:09:04.542225Z"},"content_sha256":"922f880b276d5c198d220a0f75ce5b248e3140c4ef1f4df9c8c41662f460ca4c","schema_version":"1.0","event_id":"sha256:922f880b276d5c198d220a0f75ce5b248e3140c4ef1f4df9c8c41662f460ca4c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RUNKPDKIEEVIEBJMN55ZPI5KWT/bundle.json","state_url":"https://pith.science/pith/RUNKPDKIEEVIEBJMN55ZPI5KWT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RUNKPDKIEEVIEBJMN55ZPI5KWT/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-10T17:09:04Z","links":{"resolver":"https://pith.science/pith/RUNKPDKIEEVIEBJMN55ZPI5KWT","bundle":"https://pith.science/pith/RUNKPDKIEEVIEBJMN55ZPI5KWT/bundle.json","state":"https://pith.science/pith/RUNKPDKIEEVIEBJMN55ZPI5KWT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RUNKPDKIEEVIEBJMN55ZPI5KWT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:RUNKPDKIEEVIEBJMN55ZPI5KWT","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":"b1c411aa2b5ef887c3f660ea83c74efea14a993f05c2e2bdd9f004b9921c17b1","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-01-20T18:04:53Z","title_canon_sha256":"77550087e804d22e9202a7c490667d4223e84abb35b6c10257d5dc16ca46d2f5"},"schema_version":"1.0","source":{"id":"2301.08707","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.08707","created_at":"2026-07-05T06:58:54Z"},{"alias_kind":"arxiv_version","alias_value":"2301.08707v3","created_at":"2026-07-05T06:58:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.08707","created_at":"2026-07-05T06:58:54Z"},{"alias_kind":"pith_short_12","alias_value":"RUNKPDKIEEVI","created_at":"2026-07-05T06:58:54Z"},{"alias_kind":"pith_short_16","alias_value":"RUNKPDKIEEVIEBJM","created_at":"2026-07-05T06:58:54Z"},{"alias_kind":"pith_short_8","alias_value":"RUNKPDKI","created_at":"2026-07-05T06:58:54Z"}],"graph_snapshots":[{"event_id":"sha256:922f880b276d5c198d220a0f75ce5b248e3140c4ef1f4df9c8c41662f460ca4c","target":"graph","created_at":"2026-07-05T06:58:54Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2301.08707/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recently, Letzter proved that any graph of order $n$ contains a collection $\\mathcal{P}$ of $O(n\\log^\\star n)$ paths with the following property: for all distinct edges $e$ and $f$ there exists a path in $\\mathcal{P}$ which contains $e$ but not $f$. We improve this upper bound to $19 n$, thus answering a question of G.O.H. Katona and confirming a conjecture independently posed by Balogh, Csaba, Martin, and Pluh\\'ar and by Falgas-Ravry, Kittipassorn, Kor\\'andi, Letzter, and Narayanan. Our proof is elementary and self-contained.","authors_text":"F\\'abio Botler, Fran\\c{c}ois Dross, Jozef Skokan, Marthe Bonamy, T\\'assio Naia","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-01-20T18:04:53Z","title":"Separating the edges of a graph by a linear number of paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.08707","kind":"arxiv","version":3},"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:5a723cccbe57f86a54c7a51f27b188f3e9f765c52c3b455f57212cb9c9426b87","target":"record","created_at":"2026-07-05T06:58:54Z","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":"b1c411aa2b5ef887c3f660ea83c74efea14a993f05c2e2bdd9f004b9921c17b1","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-01-20T18:04:53Z","title_canon_sha256":"77550087e804d22e9202a7c490667d4223e84abb35b6c10257d5dc16ca46d2f5"},"schema_version":"1.0","source":{"id":"2301.08707","kind":"arxiv","version":3}},"canonical_sha256":"8d1aa78d48212a82052c6f7b97a3aab4ecb5d821385b4a78f5e163803938929d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d1aa78d48212a82052c6f7b97a3aab4ecb5d821385b4a78f5e163803938929d","first_computed_at":"2026-07-05T06:58:54.733705Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:58:54.733705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IonasrwPCBD9Rm6oyjTzjZgmI4ir3zAUB7qbj12nkwaUXcUBssrmCK+wAjuHrdMGDz7v3s+/3pvam5GDp9W+DA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:58:54.734174Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.08707","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a723cccbe57f86a54c7a51f27b188f3e9f765c52c3b455f57212cb9c9426b87","sha256:922f880b276d5c198d220a0f75ce5b248e3140c4ef1f4df9c8c41662f460ca4c"],"state_sha256":"afbd64cc77f378f7416ad6c0ea457cb7ca6aa4d42b57be73a26820acc44660ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iTmgF9tp1ecW470ld7wB0ppnaiK47C05yATB9MMOX7x3pb8aw7aqL/m6PIiYKlNL3LdtvIa9tjB9wg4H7QzBCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T17:09:04.544609Z","bundle_sha256":"dc1882f60b57cdbe7f466f8d79c6292f6dd37792be77f6c1b0cc5dab1c2b3241"}}