{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:6EJASVVKNVWW3NKVJQMCKXVDVC","short_pith_number":"pith:6EJASVVK","canonical_record":{"source":{"id":"1202.5523","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-24T18:38:23Z","cross_cats_sorted":["math.RT"],"title_canon_sha256":"477275b1ec9468fa80f2b2478332228379684ec37b05106dcaa983a853c86f50","abstract_canon_sha256":"66904332bfb51cf92e1128215a1ac0cfd38e9f336d1221d1ac4d0f73247cede1"},"schema_version":"1.0"},"canonical_sha256":"f1120956aa6d6d6db5554c18255ea3a8ba9dcb935daf0d4f20a9d44496ee9a03","source":{"kind":"arxiv","id":"1202.5523","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5523","created_at":"2026-05-18T02:29:45Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5523v5","created_at":"2026-05-18T02:29:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5523","created_at":"2026-05-18T02:29:45Z"},{"alias_kind":"pith_short_12","alias_value":"6EJASVVKNVWW","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6EJASVVKNVWW3NKV","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6EJASVVK","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:6EJASVVKNVWW3NKVJQMCKXVDVC","target":"record","payload":{"canonical_record":{"source":{"id":"1202.5523","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-24T18:38:23Z","cross_cats_sorted":["math.RT"],"title_canon_sha256":"477275b1ec9468fa80f2b2478332228379684ec37b05106dcaa983a853c86f50","abstract_canon_sha256":"66904332bfb51cf92e1128215a1ac0cfd38e9f336d1221d1ac4d0f73247cede1"},"schema_version":"1.0"},"canonical_sha256":"f1120956aa6d6d6db5554c18255ea3a8ba9dcb935daf0d4f20a9d44496ee9a03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:45.868718Z","signature_b64":"h18hXhbQ0zP9OxWNWZGMVpGiKQIgJlrnoyMgF5w63ox9t1XyGD39ubwnLIk6JnoIZPWJQn2m331nNdO9+LcTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1120956aa6d6d6db5554c18255ea3a8ba9dcb935daf0d4f20a9d44496ee9a03","last_reissued_at":"2026-05-18T02:29:45.868256Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:45.868256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.5523","source_version":5,"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-18T02:29:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"42+f4luYX8+DZ4r5dd/IMH2YeGW4p5rAgHm50Gh/A4QjBGge6SUlp4/VBMvu56I3ujv0NHZ6Etkaqi8+mieCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T13:41:23.222380Z"},"content_sha256":"75ed2c597aafe96e78686ccfe561bde44af99e44a2377c72739ff28b3ba9ccee","schema_version":"1.0","event_id":"sha256:75ed2c597aafe96e78686ccfe561bde44af99e44a2377c72739ff28b3ba9ccee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:6EJASVVKNVWW3NKVJQMCKXVDVC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Walk-Sums, Continued Fractions and Unique Factorisation on Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RT"],"primary_cat":"cs.DM","authors_text":"D. Jaksch, P.-L. Giscard, S. J. Thwaite","submitted_at":"2012-02-24T18:38:23Z","abstract_excerpt":"We show that the series of all walks between any two vertices of any (possibly weighted) directed graph $\\mathcal{G}$ is given by a universal continued fraction of finite depth and breadth involving the simple paths and simple cycles of $\\mathcal{G}$. A simple path is a walk forbidden to visit any vertex more than once. We obtain an explicit formula giving this continued fraction. Our results are based on an equivalent to the fundamental theorem of arithmetic: we demonstrate that arbitrary walks on $\\mathcal{G}$ factorize uniquely into nesting products of simple paths and simple cycles, where "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5523","kind":"arxiv","version":5},"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-18T02:29:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"auZ4d3ZjNLdHTse6334Do2un9q/BZM99hUX3QK8OWjdAoxwOn+CWFOBpbp22XU7xPVidDjOXWxjSV3SVKLjIAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T13:41:23.222994Z"},"content_sha256":"8f469b5aeadca676a72b78a512c49186c4d8715bf5a84b8e1ab0189681e21396","schema_version":"1.0","event_id":"sha256:8f469b5aeadca676a72b78a512c49186c4d8715bf5a84b8e1ab0189681e21396"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6EJASVVKNVWW3NKVJQMCKXVDVC/bundle.json","state_url":"https://pith.science/pith/6EJASVVKNVWW3NKVJQMCKXVDVC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6EJASVVKNVWW3NKVJQMCKXVDVC/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-21T13:41:23Z","links":{"resolver":"https://pith.science/pith/6EJASVVKNVWW3NKVJQMCKXVDVC","bundle":"https://pith.science/pith/6EJASVVKNVWW3NKVJQMCKXVDVC/bundle.json","state":"https://pith.science/pith/6EJASVVKNVWW3NKVJQMCKXVDVC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6EJASVVKNVWW3NKVJQMCKXVDVC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6EJASVVKNVWW3NKVJQMCKXVDVC","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":"66904332bfb51cf92e1128215a1ac0cfd38e9f336d1221d1ac4d0f73247cede1","cross_cats_sorted":["math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-24T18:38:23Z","title_canon_sha256":"477275b1ec9468fa80f2b2478332228379684ec37b05106dcaa983a853c86f50"},"schema_version":"1.0","source":{"id":"1202.5523","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5523","created_at":"2026-05-18T02:29:45Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5523v5","created_at":"2026-05-18T02:29:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5523","created_at":"2026-05-18T02:29:45Z"},{"alias_kind":"pith_short_12","alias_value":"6EJASVVKNVWW","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6EJASVVKNVWW3NKV","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6EJASVVK","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:8f469b5aeadca676a72b78a512c49186c4d8715bf5a84b8e1ab0189681e21396","target":"graph","created_at":"2026-05-18T02:29:45Z","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 show that the series of all walks between any two vertices of any (possibly weighted) directed graph $\\mathcal{G}$ is given by a universal continued fraction of finite depth and breadth involving the simple paths and simple cycles of $\\mathcal{G}$. A simple path is a walk forbidden to visit any vertex more than once. We obtain an explicit formula giving this continued fraction. Our results are based on an equivalent to the fundamental theorem of arithmetic: we demonstrate that arbitrary walks on $\\mathcal{G}$ factorize uniquely into nesting products of simple paths and simple cycles, where ","authors_text":"D. Jaksch, P.-L. Giscard, S. J. Thwaite","cross_cats":["math.RT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-24T18:38:23Z","title":"Walk-Sums, Continued Fractions and Unique Factorisation on Digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5523","kind":"arxiv","version":5},"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:75ed2c597aafe96e78686ccfe561bde44af99e44a2377c72739ff28b3ba9ccee","target":"record","created_at":"2026-05-18T02:29:45Z","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":"66904332bfb51cf92e1128215a1ac0cfd38e9f336d1221d1ac4d0f73247cede1","cross_cats_sorted":["math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-24T18:38:23Z","title_canon_sha256":"477275b1ec9468fa80f2b2478332228379684ec37b05106dcaa983a853c86f50"},"schema_version":"1.0","source":{"id":"1202.5523","kind":"arxiv","version":5}},"canonical_sha256":"f1120956aa6d6d6db5554c18255ea3a8ba9dcb935daf0d4f20a9d44496ee9a03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1120956aa6d6d6db5554c18255ea3a8ba9dcb935daf0d4f20a9d44496ee9a03","first_computed_at":"2026-05-18T02:29:45.868256Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:45.868256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h18hXhbQ0zP9OxWNWZGMVpGiKQIgJlrnoyMgF5w63ox9t1XyGD39ubwnLIk6JnoIZPWJQn2m331nNdO9+LcTAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:45.868718Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.5523","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75ed2c597aafe96e78686ccfe561bde44af99e44a2377c72739ff28b3ba9ccee","sha256:8f469b5aeadca676a72b78a512c49186c4d8715bf5a84b8e1ab0189681e21396"],"state_sha256":"1dc27e6cc39d8fdfe3ef1dc9bcda8657975863db9918b244be8740a03782d504"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EikFSK3X2G9lcGGW/BLE6vsqPdZI6HX0FbM0pBGw4jyZsM7fz/PX6UCUMCt55srtwn9hrv1x++P7EaIWFjQRAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T13:41:23.226072Z","bundle_sha256":"c0881f99e73b9dd57cd6c1df230327beeba163f643a298c23eddee72bad758f9"}}