{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MQZGM4CBZNY2RDFCUPR3YG4POP","short_pith_number":"pith:MQZGM4CB","canonical_record":{"source":{"id":"1602.02797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-08T21:39:20Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"b3cf2e121f3259b4acbe8eb1b674d0c28b69cb35c3bb071bb58c336d8ace4a32","abstract_canon_sha256":"413853e1abb16bb6b7c093ee706341da7202d066f92f2fa2d9950e013e961d70"},"schema_version":"1.0"},"canonical_sha256":"6432667041cb71a88ca2a3e3bc1b8f73da8a7df6091fc24f9d84bfce76901884","source":{"kind":"arxiv","id":"1602.02797","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02797","created_at":"2026-05-18T01:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02797v1","created_at":"2026-05-18T01:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02797","created_at":"2026-05-18T01:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"MQZGM4CBZNY2","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MQZGM4CBZNY2RDFC","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MQZGM4CB","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MQZGM4CBZNY2RDFCUPR3YG4POP","target":"record","payload":{"canonical_record":{"source":{"id":"1602.02797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-08T21:39:20Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"b3cf2e121f3259b4acbe8eb1b674d0c28b69cb35c3bb071bb58c336d8ace4a32","abstract_canon_sha256":"413853e1abb16bb6b7c093ee706341da7202d066f92f2fa2d9950e013e961d70"},"schema_version":"1.0"},"canonical_sha256":"6432667041cb71a88ca2a3e3bc1b8f73da8a7df6091fc24f9d84bfce76901884","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:08.127616Z","signature_b64":"/B23JbM/YOb84y5W4OHv7ovwXfJi4j8h/hZQDYlTzcUfuycy1j0+nqf06Zp3SiBMVV8bRhhk5Ui1pQFVHh5PCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6432667041cb71a88ca2a3e3bc1b8f73da8a7df6091fc24f9d84bfce76901884","last_reissued_at":"2026-05-18T01:21:08.126966Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:08.126966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.02797","source_version":1,"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-18T01:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O1iC4jH1+fLXDKZxzidcK6kPmoHfK7MhkcbVQKE2564CtvbMfWzQL0L1jUWxt/SZ8zIB/fvghNqRxr9TZ3OFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:32:51.409834Z"},"content_sha256":"ccfc3a5a36529513c2da7bfa1d388c5d1f9ded800f93fac49f268e16cc71b0ec","schema_version":"1.0","event_id":"sha256:ccfc3a5a36529513c2da7bfa1d388c5d1f9ded800f93fac49f268e16cc71b0ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MQZGM4CBZNY2RDFCUPR3YG4POP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spanning Trees and Mahler Measure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.CO","authors_text":"Daniel S. Silver, Susan G. Williams","submitted_at":"2016-02-08T21:39:20Z","abstract_excerpt":"The complexity of a finite connected graph is its number of spanning trees; for a non-connected graph it is the product of complexities of its connected components. If $G$ is an infinite graph with cofinite free ${\\mathbb Z}^d$-symmetry, then the logarithmic Mahler measure $m(\\Delta)$ of its Laplacian polynomial $\\Delta$ is the exponential growth rate of the complexity of finite quotients of $G$. It is bounded below by $m(\\Delta({\\mathbb G}_d))$, where ${\\mathbb G}_d$ is the grid graph of dimension $d$. The growth rates $m(\\Delta({\\mathbb G}_d))$ are asymptotic to $\\log 2d$ as $d$ tends to inf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02797","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"},"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-18T01:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G6EFc61ZPB4fSOvIpe2h3m/Y06sIPX/wDUNyaTIO3KQ49xrSvVK69l9LQ6QJMZnpYla7VKnnBWmL5+ufwNTKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:32:51.410433Z"},"content_sha256":"fa223e482a3c15525bb39158df183ddb7fca6524a0a03b618d91f2211b3d3258","schema_version":"1.0","event_id":"sha256:fa223e482a3c15525bb39158df183ddb7fca6524a0a03b618d91f2211b3d3258"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MQZGM4CBZNY2RDFCUPR3YG4POP/bundle.json","state_url":"https://pith.science/pith/MQZGM4CBZNY2RDFCUPR3YG4POP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MQZGM4CBZNY2RDFCUPR3YG4POP/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-27T10:32:51Z","links":{"resolver":"https://pith.science/pith/MQZGM4CBZNY2RDFCUPR3YG4POP","bundle":"https://pith.science/pith/MQZGM4CBZNY2RDFCUPR3YG4POP/bundle.json","state":"https://pith.science/pith/MQZGM4CBZNY2RDFCUPR3YG4POP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MQZGM4CBZNY2RDFCUPR3YG4POP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MQZGM4CBZNY2RDFCUPR3YG4POP","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":"413853e1abb16bb6b7c093ee706341da7202d066f92f2fa2d9950e013e961d70","cross_cats_sorted":["math.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-08T21:39:20Z","title_canon_sha256":"b3cf2e121f3259b4acbe8eb1b674d0c28b69cb35c3bb071bb58c336d8ace4a32"},"schema_version":"1.0","source":{"id":"1602.02797","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02797","created_at":"2026-05-18T01:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02797v1","created_at":"2026-05-18T01:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02797","created_at":"2026-05-18T01:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"MQZGM4CBZNY2","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MQZGM4CBZNY2RDFC","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MQZGM4CB","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:fa223e482a3c15525bb39158df183ddb7fca6524a0a03b618d91f2211b3d3258","target":"graph","created_at":"2026-05-18T01:21:08Z","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 complexity of a finite connected graph is its number of spanning trees; for a non-connected graph it is the product of complexities of its connected components. If $G$ is an infinite graph with cofinite free ${\\mathbb Z}^d$-symmetry, then the logarithmic Mahler measure $m(\\Delta)$ of its Laplacian polynomial $\\Delta$ is the exponential growth rate of the complexity of finite quotients of $G$. It is bounded below by $m(\\Delta({\\mathbb G}_d))$, where ${\\mathbb G}_d$ is the grid graph of dimension $d$. The growth rates $m(\\Delta({\\mathbb G}_d))$ are asymptotic to $\\log 2d$ as $d$ tends to inf","authors_text":"Daniel S. Silver, Susan G. Williams","cross_cats":["math.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-08T21:39:20Z","title":"Spanning Trees and Mahler Measure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02797","kind":"arxiv","version":1},"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:ccfc3a5a36529513c2da7bfa1d388c5d1f9ded800f93fac49f268e16cc71b0ec","target":"record","created_at":"2026-05-18T01:21:08Z","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":"413853e1abb16bb6b7c093ee706341da7202d066f92f2fa2d9950e013e961d70","cross_cats_sorted":["math.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-08T21:39:20Z","title_canon_sha256":"b3cf2e121f3259b4acbe8eb1b674d0c28b69cb35c3bb071bb58c336d8ace4a32"},"schema_version":"1.0","source":{"id":"1602.02797","kind":"arxiv","version":1}},"canonical_sha256":"6432667041cb71a88ca2a3e3bc1b8f73da8a7df6091fc24f9d84bfce76901884","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6432667041cb71a88ca2a3e3bc1b8f73da8a7df6091fc24f9d84bfce76901884","first_computed_at":"2026-05-18T01:21:08.126966Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:08.126966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/B23JbM/YOb84y5W4OHv7ovwXfJi4j8h/hZQDYlTzcUfuycy1j0+nqf06Zp3SiBMVV8bRhhk5Ui1pQFVHh5PCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:08.127616Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.02797","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ccfc3a5a36529513c2da7bfa1d388c5d1f9ded800f93fac49f268e16cc71b0ec","sha256:fa223e482a3c15525bb39158df183ddb7fca6524a0a03b618d91f2211b3d3258"],"state_sha256":"93d0de31e0d4eac5a74400e471899c6a2a529c446482321710a8aaeea63b5b03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TwMVwvq+rzMWo+nuIXRH7KG+iumCNE9Z1ZgZm16+/Yq1n1Y0iBWZ6zsQf+JPLl+8MoQOT8m2PRRWScYtJ0qeAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:32:51.413351Z","bundle_sha256":"423e8580ddb2afec9b4ea26fc05d4adc3b623379d3c358867f37a6f507cb6a00"}}