{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:K36SLX7HN3P2X7N7KXK2XNPTO6","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":"dcf585df2589d7da87f8ffcd0891799a3cc6f0dda3fa223580df8f740dfb3ee4","cross_cats_sorted":["math.MG","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-11-16T16:56:30Z","title_canon_sha256":"e77a5b4611d54aae31d43f92a2db49142fb0d0d8162ea2f693c81f90252fc90e"},"schema_version":"1.0","source":{"id":"2311.10014","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.10014","created_at":"2026-07-05T07:13:36Z"},{"alias_kind":"arxiv_version","alias_value":"2311.10014v1","created_at":"2026-07-05T07:13:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.10014","created_at":"2026-07-05T07:13:36Z"},{"alias_kind":"pith_short_12","alias_value":"K36SLX7HN3P2","created_at":"2026-07-05T07:13:36Z"},{"alias_kind":"pith_short_16","alias_value":"K36SLX7HN3P2X7N7","created_at":"2026-07-05T07:13:36Z"},{"alias_kind":"pith_short_8","alias_value":"K36SLX7H","created_at":"2026-07-05T07:13:36Z"}],"graph_snapshots":[{"event_id":"sha256:bab44e3cc63c02765f4f7ee36952ab29cf1d2b8c803f2d633bf915b6d0b00dc9","target":"graph","created_at":"2026-07-05T07:13:36Z","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/2311.10014/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"It is proved that the number of shortest paths between two vertices of distance $t$ in a graph with degrees bounded by $\\Delta$ is at most $2 \\cdot (\\frac{\\Delta}{2})^t$. This improves upon the na\\\"ive $\\Delta (\\Delta-1) ^{t-1}$ bound.","authors_text":"Elad Tzalik, Itai Benjamini","cross_cats":["math.MG","math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-11-16T16:56:30Z","title":"On the Number of Shortest Paths in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.10014","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:93397a1f96aac6f3bfdbbbf530941a002333e1778e3760d9aca4942f701972a1","target":"record","created_at":"2026-07-05T07:13:36Z","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":"dcf585df2589d7da87f8ffcd0891799a3cc6f0dda3fa223580df8f740dfb3ee4","cross_cats_sorted":["math.MG","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-11-16T16:56:30Z","title_canon_sha256":"e77a5b4611d54aae31d43f92a2db49142fb0d0d8162ea2f693c81f90252fc90e"},"schema_version":"1.0","source":{"id":"2311.10014","kind":"arxiv","version":1}},"canonical_sha256":"56fd25dfe76edfabfdbf55d5abb5f37787584c0dcd87c09789dd12be5bfe4691","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56fd25dfe76edfabfdbf55d5abb5f37787584c0dcd87c09789dd12be5bfe4691","first_computed_at":"2026-07-05T07:13:36.438200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:13:36.438200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p0PjKi/ZUy6jmL3y7HsRrcCxKwzpcjQr+C8n7V3vfjv43CMBUgKxDZVAJbeYDVCLZS549rzRUDe1VMry8O2MDg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:13:36.438692Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.10014","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93397a1f96aac6f3bfdbbbf530941a002333e1778e3760d9aca4942f701972a1","sha256:bab44e3cc63c02765f4f7ee36952ab29cf1d2b8c803f2d633bf915b6d0b00dc9"],"state_sha256":"87ccb6186563d8fc3a8308a937da164ed5872265df45ea9461c6af97dfaf22dc"}