{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7XRFW6TAGJEVQI7BG3NACXEX7O","short_pith_number":"pith:7XRFW6TA","schema_version":"1.0","canonical_sha256":"fde25b7a6032495823e136da015c97fb834a63f1984bcc119a14095f4f473a31","source":{"kind":"arxiv","id":"1612.05505","version":4},"attestation_state":"computed","paper":{"title":"Super-Walk Formulae for Even and Odd Laplacians in Finite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.CO","authors_text":"Chengzheng Yu","submitted_at":"2016-12-15T04:02:31Z","abstract_excerpt":"The number of walks from one vertex to another in a finite graph can be counted by the adjacency matrix. In this paper, we prove two theorems that connect the graph Laplacian with two types of walks in a graph. By defining two types of walks and giving orientation to a finite graph, one can easily count the number of the total signs of each kind of walk from one element to another of a fixed length."},"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":"1612.05505","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-15T04:02:31Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"e2cf5f6ec992a9b32bae0dd6e1a67a58d0ed00f2ab55babc668da9db4f53f50d","abstract_canon_sha256":"ca877fb96e4b2ee8cd5e9f04a76734ca06d0354134b71c01fa2ca968d96d7cb0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:28.684966Z","signature_b64":"0nwwnFsPrFVZ6VsFJxNn8ZTOIXvhZJDZWNEXw6Q6I0lJiLnK6JcI/dcb0BTMrw9U5dL8sGX/SOe4pAzxBKfIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fde25b7a6032495823e136da015c97fb834a63f1984bcc119a14095f4f473a31","last_reissued_at":"2026-05-18T00:40:28.684427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:28.684427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Super-Walk Formulae for Even and Odd Laplacians in Finite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.CO","authors_text":"Chengzheng Yu","submitted_at":"2016-12-15T04:02:31Z","abstract_excerpt":"The number of walks from one vertex to another in a finite graph can be counted by the adjacency matrix. In this paper, we prove two theorems that connect the graph Laplacian with two types of walks in a graph. By defining two types of walks and giving orientation to a finite graph, one can easily count the number of the total signs of each kind of walk from one element to another of a fixed length."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05505","kind":"arxiv","version":4},"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":"1612.05505","created_at":"2026-05-18T00:40:28.684494+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.05505v4","created_at":"2026-05-18T00:40:28.684494+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05505","created_at":"2026-05-18T00:40:28.684494+00:00"},{"alias_kind":"pith_short_12","alias_value":"7XRFW6TAGJEV","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7XRFW6TAGJEVQI7B","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7XRFW6TA","created_at":"2026-05-18T12:30:04.600751+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/7XRFW6TAGJEVQI7BG3NACXEX7O","json":"https://pith.science/pith/7XRFW6TAGJEVQI7BG3NACXEX7O.json","graph_json":"https://pith.science/api/pith-number/7XRFW6TAGJEVQI7BG3NACXEX7O/graph.json","events_json":"https://pith.science/api/pith-number/7XRFW6TAGJEVQI7BG3NACXEX7O/events.json","paper":"https://pith.science/paper/7XRFW6TA"},"agent_actions":{"view_html":"https://pith.science/pith/7XRFW6TAGJEVQI7BG3NACXEX7O","download_json":"https://pith.science/pith/7XRFW6TAGJEVQI7BG3NACXEX7O.json","view_paper":"https://pith.science/paper/7XRFW6TA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.05505&json=true","fetch_graph":"https://pith.science/api/pith-number/7XRFW6TAGJEVQI7BG3NACXEX7O/graph.json","fetch_events":"https://pith.science/api/pith-number/7XRFW6TAGJEVQI7BG3NACXEX7O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7XRFW6TAGJEVQI7BG3NACXEX7O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7XRFW6TAGJEVQI7BG3NACXEX7O/action/storage_attestation","attest_author":"https://pith.science/pith/7XRFW6TAGJEVQI7BG3NACXEX7O/action/author_attestation","sign_citation":"https://pith.science/pith/7XRFW6TAGJEVQI7BG3NACXEX7O/action/citation_signature","submit_replication":"https://pith.science/pith/7XRFW6TAGJEVQI7BG3NACXEX7O/action/replication_record"}},"created_at":"2026-05-18T00:40:28.684494+00:00","updated_at":"2026-05-18T00:40:28.684494+00:00"}