{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2000:EFZQ7QYYHLWRMSTWPCKLCAAMA6","short_pith_number":"pith:EFZQ7QYY","canonical_record":{"source":{"id":"math/0012161","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2000-12-18T04:01:02Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"091b646b9f842a41533d748c2db779dc414004313e4913a3d6062dcd48ca1ad4","abstract_canon_sha256":"b8691afa7a5198191af333178770727c98743435393200317cb71d8fdd7b5c13"},"schema_version":"1.0"},"canonical_sha256":"21730fc3183aed164a767894b1000c0798cfab756ebd9ebc1fc7d209be5fe504","source":{"kind":"arxiv","id":"math/0012161","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0012161","created_at":"2026-07-04T15:12:00Z"},{"alias_kind":"arxiv_version","alias_value":"math/0012161v2","created_at":"2026-07-04T15:12:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0012161","created_at":"2026-07-04T15:12:00Z"},{"alias_kind":"pith_short_12","alias_value":"EFZQ7QYYHLWR","created_at":"2026-07-04T15:12:00Z"},{"alias_kind":"pith_short_16","alias_value":"EFZQ7QYYHLWRMSTW","created_at":"2026-07-04T15:12:00Z"},{"alias_kind":"pith_short_8","alias_value":"EFZQ7QYY","created_at":"2026-07-04T15:12:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2000:EFZQ7QYYHLWRMSTWPCKLCAAMA6","target":"record","payload":{"canonical_record":{"source":{"id":"math/0012161","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2000-12-18T04:01:02Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"091b646b9f842a41533d748c2db779dc414004313e4913a3d6062dcd48ca1ad4","abstract_canon_sha256":"b8691afa7a5198191af333178770727c98743435393200317cb71d8fdd7b5c13"},"schema_version":"1.0"},"canonical_sha256":"21730fc3183aed164a767894b1000c0798cfab756ebd9ebc1fc7d209be5fe504","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:12:00.294110Z","signature_b64":"zOSu5A00AF5eM8BCDt+1u2PgZR9nL1vSP+hoYhEDqJAYr0bi/m3cEqFigGhVysSquDGlNrU6aBSxDYB82of5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21730fc3183aed164a767894b1000c0798cfab756ebd9ebc1fc7d209be5fe504","last_reissued_at":"2026-07-04T15:12:00.293748Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:12:00.293748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0012161","source_version":2,"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-04T15:12:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1PcvOSOdaqyvey3PzITkCCAu+PUTcg5pDQOaqVcuJcCKLa7Sz66lSFjJw9i/oeCdKoNMSZhTZyMHd1Of84pHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T23:34:41.242346Z"},"content_sha256":"baf4170cb50a9b4b6be539ef943bfd128e98f4869696a9b459d7c3e4970b73c4","schema_version":"1.0","event_id":"sha256:baf4170cb50a9b4b6be539ef943bfd128e98f4869696a9b459d7c3e4970b73c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2000:EFZQ7QYYHLWRMSTWPCKLCAAMA6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting Paths in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Laurent Bartholdi","submitted_at":"2000-12-18T04:01:02Z","abstract_excerpt":"We give a simple combinatorial proof of a formula that extends a result by Grigorchuk (rediscovered by Cohen) relating cogrowth and spectral radius of random walks. Our main result is an explicit equation determining the number of `bumps' on paths in a graph: in a $d$-regular (not necessarily transitive) non-oriented graph let the series $G(t)$ count all paths between two fixed points weighted by their length $t^{length}$, and $F(u,t)$ count the same paths, weighted as $u^{number of bumps}t^{length}$. Then one has $$F(1-u,t)/(1-u^2t^2) = G(t/(1+u(d-u)t^2))/(1+u(d-u)t^2).$$ We then derive the c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0012161","kind":"arxiv","version":2},"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/math/0012161/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-04T15:12:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GVtF4LFvogDjbzxGHbqYTjDgSG79dA3Um/ZKdtrlLdRnAXcNl+8sPlvuizDE43KODMmPl3SVDKzadrtkRkkrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T23:34:41.242875Z"},"content_sha256":"b653fb696144140ff3afe5e6763499c65a2984410030ab4156ce58f26c336acd","schema_version":"1.0","event_id":"sha256:b653fb696144140ff3afe5e6763499c65a2984410030ab4156ce58f26c336acd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EFZQ7QYYHLWRMSTWPCKLCAAMA6/bundle.json","state_url":"https://pith.science/pith/EFZQ7QYYHLWRMSTWPCKLCAAMA6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EFZQ7QYYHLWRMSTWPCKLCAAMA6/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-08-15T23:34:41Z","links":{"resolver":"https://pith.science/pith/EFZQ7QYYHLWRMSTWPCKLCAAMA6","bundle":"https://pith.science/pith/EFZQ7QYYHLWRMSTWPCKLCAAMA6/bundle.json","state":"https://pith.science/pith/EFZQ7QYYHLWRMSTWPCKLCAAMA6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EFZQ7QYYHLWRMSTWPCKLCAAMA6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2000:EFZQ7QYYHLWRMSTWPCKLCAAMA6","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":"b8691afa7a5198191af333178770727c98743435393200317cb71d8fdd7b5c13","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2000-12-18T04:01:02Z","title_canon_sha256":"091b646b9f842a41533d748c2db779dc414004313e4913a3d6062dcd48ca1ad4"},"schema_version":"1.0","source":{"id":"math/0012161","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0012161","created_at":"2026-07-04T15:12:00Z"},{"alias_kind":"arxiv_version","alias_value":"math/0012161v2","created_at":"2026-07-04T15:12:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0012161","created_at":"2026-07-04T15:12:00Z"},{"alias_kind":"pith_short_12","alias_value":"EFZQ7QYYHLWR","created_at":"2026-07-04T15:12:00Z"},{"alias_kind":"pith_short_16","alias_value":"EFZQ7QYYHLWRMSTW","created_at":"2026-07-04T15:12:00Z"},{"alias_kind":"pith_short_8","alias_value":"EFZQ7QYY","created_at":"2026-07-04T15:12:00Z"}],"graph_snapshots":[{"event_id":"sha256:b653fb696144140ff3afe5e6763499c65a2984410030ab4156ce58f26c336acd","target":"graph","created_at":"2026-07-04T15:12:00Z","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/math/0012161/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give a simple combinatorial proof of a formula that extends a result by Grigorchuk (rediscovered by Cohen) relating cogrowth and spectral radius of random walks. Our main result is an explicit equation determining the number of `bumps' on paths in a graph: in a $d$-regular (not necessarily transitive) non-oriented graph let the series $G(t)$ count all paths between two fixed points weighted by their length $t^{length}$, and $F(u,t)$ count the same paths, weighted as $u^{number of bumps}t^{length}$. Then one has $$F(1-u,t)/(1-u^2t^2) = G(t/(1+u(d-u)t^2))/(1+u(d-u)t^2).$$ We then derive the c","authors_text":"Laurent Bartholdi","cross_cats":["math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2000-12-18T04:01:02Z","title":"Counting Paths in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0012161","kind":"arxiv","version":2},"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:baf4170cb50a9b4b6be539ef943bfd128e98f4869696a9b459d7c3e4970b73c4","target":"record","created_at":"2026-07-04T15:12:00Z","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":"b8691afa7a5198191af333178770727c98743435393200317cb71d8fdd7b5c13","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2000-12-18T04:01:02Z","title_canon_sha256":"091b646b9f842a41533d748c2db779dc414004313e4913a3d6062dcd48ca1ad4"},"schema_version":"1.0","source":{"id":"math/0012161","kind":"arxiv","version":2}},"canonical_sha256":"21730fc3183aed164a767894b1000c0798cfab756ebd9ebc1fc7d209be5fe504","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21730fc3183aed164a767894b1000c0798cfab756ebd9ebc1fc7d209be5fe504","first_computed_at":"2026-07-04T15:12:00.293748Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:12:00.293748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zOSu5A00AF5eM8BCDt+1u2PgZR9nL1vSP+hoYhEDqJAYr0bi/m3cEqFigGhVysSquDGlNrU6aBSxDYB82of5CA==","signature_status":"signed_v1","signed_at":"2026-07-04T15:12:00.294110Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0012161","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:baf4170cb50a9b4b6be539ef943bfd128e98f4869696a9b459d7c3e4970b73c4","sha256:b653fb696144140ff3afe5e6763499c65a2984410030ab4156ce58f26c336acd"],"state_sha256":"0baedcd90e871c21dbb61c1ea37a1e3091666736f7c7057054832942550592df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/XkF6FDV1KCXh5KEyw52Pr3hd3i2fWbrbwHl6fvYEH4pnM+zB9zvwo2fBn6ZtL455vFYWSx9MjXZFn2cVDatBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T23:34:41.247512Z","bundle_sha256":"c94b5dc3d2937e20e3a198d8cf4336fdbfadaafead1ca06933f95f7d7c76e7ad"}}