{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZRMEZ2VEEIO37NRPAPNU7BLWUG","short_pith_number":"pith:ZRMEZ2VE","schema_version":"1.0","canonical_sha256":"cc584ceaa4221dbfb62f03db4f8576a18c67dcfa7cf60ef6db297543bb145688","source":{"kind":"arxiv","id":"1206.0860","version":1},"attestation_state":"computed","paper":{"title":"Number of walks and degree powers in a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.SP"],"primary_cat":"math.CO","authors_text":"E. Garriga, M. A. Fiol","submitted_at":"2012-06-05T09:43:03Z","abstract_excerpt":"This note deals with the relationship between the total number of $k$-walks in a graph, and the sum of the $k$-th powers of its vertex degrees. In particular, it is shown that the the number of all $k$-walks is upper bounded by the sum of the $k$-th powers of the degrees."},"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":"1206.0860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-05T09:43:03Z","cross_cats_sorted":["math.SP"],"title_canon_sha256":"1f5f8c1b37bed64fd6fc47ed231dca6ac48bf995842cb919ee8c00c97fe4bb4e","abstract_canon_sha256":"3659aca3e34eba3c19d075e8dca197b38178ee493afb0e0688f072b0c17585ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:16.119520Z","signature_b64":"4jqnSNvpeP7w8WWVI2JGH6LsA2u1mnho/NgqUc9+irBvbU3woFeF5kTDgSsYObdYYCY6oXZOq+Wc4jM5BL71Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc584ceaa4221dbfb62f03db4f8576a18c67dcfa7cf60ef6db297543bb145688","last_reissued_at":"2026-05-18T03:54:16.118496Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:16.118496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Number of walks and degree powers in a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.SP"],"primary_cat":"math.CO","authors_text":"E. Garriga, M. A. Fiol","submitted_at":"2012-06-05T09:43:03Z","abstract_excerpt":"This note deals with the relationship between the total number of $k$-walks in a graph, and the sum of the $k$-th powers of its vertex degrees. In particular, it is shown that the the number of all $k$-walks is upper bounded by the sum of the $k$-th powers of the degrees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.0860","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":"1206.0860","created_at":"2026-05-18T03:54:16.118669+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.0860v1","created_at":"2026-05-18T03:54:16.118669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0860","created_at":"2026-05-18T03:54:16.118669+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZRMEZ2VEEIO3","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZRMEZ2VEEIO37NRP","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZRMEZ2VE","created_at":"2026-05-18T12:27:30.460161+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/ZRMEZ2VEEIO37NRPAPNU7BLWUG","json":"https://pith.science/pith/ZRMEZ2VEEIO37NRPAPNU7BLWUG.json","graph_json":"https://pith.science/api/pith-number/ZRMEZ2VEEIO37NRPAPNU7BLWUG/graph.json","events_json":"https://pith.science/api/pith-number/ZRMEZ2VEEIO37NRPAPNU7BLWUG/events.json","paper":"https://pith.science/paper/ZRMEZ2VE"},"agent_actions":{"view_html":"https://pith.science/pith/ZRMEZ2VEEIO37NRPAPNU7BLWUG","download_json":"https://pith.science/pith/ZRMEZ2VEEIO37NRPAPNU7BLWUG.json","view_paper":"https://pith.science/paper/ZRMEZ2VE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.0860&json=true","fetch_graph":"https://pith.science/api/pith-number/ZRMEZ2VEEIO37NRPAPNU7BLWUG/graph.json","fetch_events":"https://pith.science/api/pith-number/ZRMEZ2VEEIO37NRPAPNU7BLWUG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZRMEZ2VEEIO37NRPAPNU7BLWUG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZRMEZ2VEEIO37NRPAPNU7BLWUG/action/storage_attestation","attest_author":"https://pith.science/pith/ZRMEZ2VEEIO37NRPAPNU7BLWUG/action/author_attestation","sign_citation":"https://pith.science/pith/ZRMEZ2VEEIO37NRPAPNU7BLWUG/action/citation_signature","submit_replication":"https://pith.science/pith/ZRMEZ2VEEIO37NRPAPNU7BLWUG/action/replication_record"}},"created_at":"2026-05-18T03:54:16.118669+00:00","updated_at":"2026-05-18T03:54:16.118669+00:00"}