{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7XRFW6TAGJEVQI7BG3NACXEX7O","short_pith_number":"pith:7XRFW6TA","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"},"canonical_sha256":"fde25b7a6032495823e136da015c97fb834a63f1984bcc119a14095f4f473a31","source":{"kind":"arxiv","id":"1612.05505","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05505","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05505v4","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05505","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"pith_short_12","alias_value":"7XRFW6TAGJEV","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7XRFW6TAGJEVQI7B","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7XRFW6TA","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7XRFW6TAGJEVQI7BG3NACXEX7O","target":"record","payload":{"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"},"canonical_sha256":"fde25b7a6032495823e136da015c97fb834a63f1984bcc119a14095f4f473a31","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"},"source_kind":"arxiv","source_id":"1612.05505","source_version":4,"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-18T00:40:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xfA9/bRnwVvoihF/sxvgxoa9En6mkjksWcJfA+GTLR5XYHn/ggBZQNNuM6u8chckz/47BtApeB409a37gLrUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:00:56.483044Z"},"content_sha256":"18a1d6780873e6531ccd79b0668f29da70b614f08df3c34af4234df8eb334467","schema_version":"1.0","event_id":"sha256:18a1d6780873e6531ccd79b0668f29da70b614f08df3c34af4234df8eb334467"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7XRFW6TAGJEVQI7BG3NACXEX7O","target":"graph","payload":{"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"},"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-18T00:40:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"emBvode10XbQkprqnZO0/i6wbRwcyQsop494XSKbGIAYkRyuIiMy7CsTHMiMPTaqFU4lE627X1QLm7bqoyFBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:00:56.483395Z"},"content_sha256":"8009f52ed7699d7e9a3476cb8c42d291e84f1f29e9ad3d5020dab92967a99997","schema_version":"1.0","event_id":"sha256:8009f52ed7699d7e9a3476cb8c42d291e84f1f29e9ad3d5020dab92967a99997"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7XRFW6TAGJEVQI7BG3NACXEX7O/bundle.json","state_url":"https://pith.science/pith/7XRFW6TAGJEVQI7BG3NACXEX7O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7XRFW6TAGJEVQI7BG3NACXEX7O/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-06-03T14:00:56Z","links":{"resolver":"https://pith.science/pith/7XRFW6TAGJEVQI7BG3NACXEX7O","bundle":"https://pith.science/pith/7XRFW6TAGJEVQI7BG3NACXEX7O/bundle.json","state":"https://pith.science/pith/7XRFW6TAGJEVQI7BG3NACXEX7O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7XRFW6TAGJEVQI7BG3NACXEX7O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7XRFW6TAGJEVQI7BG3NACXEX7O","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":"ca877fb96e4b2ee8cd5e9f04a76734ca06d0354134b71c01fa2ca968d96d7cb0","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-15T04:02:31Z","title_canon_sha256":"e2cf5f6ec992a9b32bae0dd6e1a67a58d0ed00f2ab55babc668da9db4f53f50d"},"schema_version":"1.0","source":{"id":"1612.05505","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05505","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05505v4","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05505","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"pith_short_12","alias_value":"7XRFW6TAGJEV","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7XRFW6TAGJEVQI7B","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7XRFW6TA","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:8009f52ed7699d7e9a3476cb8c42d291e84f1f29e9ad3d5020dab92967a99997","target":"graph","created_at":"2026-05-18T00:40:28Z","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":"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.","authors_text":"Chengzheng Yu","cross_cats":["math-ph","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-15T04:02:31Z","title":"Super-Walk Formulae for Even and Odd Laplacians in Finite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05505","kind":"arxiv","version":4},"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:18a1d6780873e6531ccd79b0668f29da70b614f08df3c34af4234df8eb334467","target":"record","created_at":"2026-05-18T00:40:28Z","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":"ca877fb96e4b2ee8cd5e9f04a76734ca06d0354134b71c01fa2ca968d96d7cb0","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-15T04:02:31Z","title_canon_sha256":"e2cf5f6ec992a9b32bae0dd6e1a67a58d0ed00f2ab55babc668da9db4f53f50d"},"schema_version":"1.0","source":{"id":"1612.05505","kind":"arxiv","version":4}},"canonical_sha256":"fde25b7a6032495823e136da015c97fb834a63f1984bcc119a14095f4f473a31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fde25b7a6032495823e136da015c97fb834a63f1984bcc119a14095f4f473a31","first_computed_at":"2026-05-18T00:40:28.684427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:28.684427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0nwwnFsPrFVZ6VsFJxNn8ZTOIXvhZJDZWNEXw6Q6I0lJiLnK6JcI/dcb0BTMrw9U5dL8sGX/SOe4pAzxBKfIAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:28.684966Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.05505","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18a1d6780873e6531ccd79b0668f29da70b614f08df3c34af4234df8eb334467","sha256:8009f52ed7699d7e9a3476cb8c42d291e84f1f29e9ad3d5020dab92967a99997"],"state_sha256":"9fc8cb2bde1209b79fbf6bdfe2617cedbd890abcbff109056247ff8f4651a94a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GcEjcio5Nl93qNedMWWLBiaVbqil0lxeKwSus//rSR0e9cS2h0CwL8q3vV1V9v+6ce3mW8xBodVgG7Bb1quQBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:00:56.485247Z","bundle_sha256":"7a5120cf116b635e2b2d814f1680d7e4411fbdb17c36ff15e5881264645d717a"}}