{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:UND2WDLYL4KLHXJKYNTIQSGQQ4","short_pith_number":"pith:UND2WDLY","canonical_record":{"source":{"id":"1110.6841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2011-10-31T15:48:49Z","cross_cats_sorted":["math.CO","math.MP"],"title_canon_sha256":"12f19dd66b3e9007699a9de00b6c950850e8e1052d38b5e9a826393a89da7f7d","abstract_canon_sha256":"5b2a72c4caf8130af504f616b31eba19e9f5ac2907cef6805f790b48047b7a1a"},"schema_version":"1.0"},"canonical_sha256":"a347ab0d785f14b3dd2ac3668848d0872cbc2389b9d3114513798baae268d2ac","source":{"kind":"arxiv","id":"1110.6841","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.6841","created_at":"2026-05-18T04:09:54Z"},{"alias_kind":"arxiv_version","alias_value":"1110.6841v1","created_at":"2026-05-18T04:09:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.6841","created_at":"2026-05-18T04:09:54Z"},{"alias_kind":"pith_short_12","alias_value":"UND2WDLYL4KL","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UND2WDLYL4KLHXJK","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UND2WDLY","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:UND2WDLYL4KLHXJKYNTIQSGQQ4","target":"record","payload":{"canonical_record":{"source":{"id":"1110.6841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2011-10-31T15:48:49Z","cross_cats_sorted":["math.CO","math.MP"],"title_canon_sha256":"12f19dd66b3e9007699a9de00b6c950850e8e1052d38b5e9a826393a89da7f7d","abstract_canon_sha256":"5b2a72c4caf8130af504f616b31eba19e9f5ac2907cef6805f790b48047b7a1a"},"schema_version":"1.0"},"canonical_sha256":"a347ab0d785f14b3dd2ac3668848d0872cbc2389b9d3114513798baae268d2ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:54.080381Z","signature_b64":"CQ0X1Wi0tYkHnDCHGpuq8g+1tMpfZ0bhBUboKPDhlO9Oo9/rWkXEKVIWS/zazRCLGn/RuPdLS7coepkRTzCUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a347ab0d785f14b3dd2ac3668848d0872cbc2389b9d3114513798baae268d2ac","last_reissued_at":"2026-05-18T04:09:54.079778Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:54.079778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.6841","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-18T04:09:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QKp59yi/8sm8TEmPg7IikiM9/yx5YH6Y46Pbkf2XJlQ5fLGSxfkJC/THe+VMA8HVenktfdunfTZZM/+Fu0mqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:46:20.503006Z"},"content_sha256":"bc8db457a6c67619bf64a3a3533704e9f2c5cdf048d39b8cf9f87c6920eed087","schema_version":"1.0","event_id":"sha256:bc8db457a6c67619bf64a3a3533704e9f2c5cdf048d39b8cf9f87c6920eed087"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:UND2WDLYL4KLHXJKYNTIQSGQQ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity and heights of tori","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.MP"],"primary_cat":"math-ph","authors_text":"Anders Karlsson, Gautam Chinta, Jay Jorgenson","submitted_at":"2011-10-31T15:48:49Z","abstract_excerpt":"We prove detailed asymptotics for the number of spanning trees, called complexity, for a general class of discrete tori as the parameters tend to infinity. The proof uses in particular certain ideas and techniques from an earlier paper. Our asymptotic formula provides a link between the complexity of these graphs and the height of associated real tori, and allows us to deduce some corollaries on the complexity thanks to certain results from analytic number theory. In this way we obtain a conjectural relationship between complexity and regular sphere packings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.6841","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-18T04:09:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i4IBPxl9VQNQwO+ZcZ82HrasUTobjKTbwRTNTqPbyj5ikgKWnJCr6qwSYDwd3qg5qrPQmuzqNs0JrDgKvyCpAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:46:20.503393Z"},"content_sha256":"dc4b493064b3bca657e8097cae0c6a353e0625382cd387862b1c33977a0997bd","schema_version":"1.0","event_id":"sha256:dc4b493064b3bca657e8097cae0c6a353e0625382cd387862b1c33977a0997bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UND2WDLYL4KLHXJKYNTIQSGQQ4/bundle.json","state_url":"https://pith.science/pith/UND2WDLYL4KLHXJKYNTIQSGQQ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UND2WDLYL4KLHXJKYNTIQSGQQ4/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-31T06:46:20Z","links":{"resolver":"https://pith.science/pith/UND2WDLYL4KLHXJKYNTIQSGQQ4","bundle":"https://pith.science/pith/UND2WDLYL4KLHXJKYNTIQSGQQ4/bundle.json","state":"https://pith.science/pith/UND2WDLYL4KLHXJKYNTIQSGQQ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UND2WDLYL4KLHXJKYNTIQSGQQ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:UND2WDLYL4KLHXJKYNTIQSGQQ4","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":"5b2a72c4caf8130af504f616b31eba19e9f5ac2907cef6805f790b48047b7a1a","cross_cats_sorted":["math.CO","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2011-10-31T15:48:49Z","title_canon_sha256":"12f19dd66b3e9007699a9de00b6c950850e8e1052d38b5e9a826393a89da7f7d"},"schema_version":"1.0","source":{"id":"1110.6841","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.6841","created_at":"2026-05-18T04:09:54Z"},{"alias_kind":"arxiv_version","alias_value":"1110.6841v1","created_at":"2026-05-18T04:09:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.6841","created_at":"2026-05-18T04:09:54Z"},{"alias_kind":"pith_short_12","alias_value":"UND2WDLYL4KL","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UND2WDLYL4KLHXJK","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UND2WDLY","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:dc4b493064b3bca657e8097cae0c6a353e0625382cd387862b1c33977a0997bd","target":"graph","created_at":"2026-05-18T04:09:54Z","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":"We prove detailed asymptotics for the number of spanning trees, called complexity, for a general class of discrete tori as the parameters tend to infinity. The proof uses in particular certain ideas and techniques from an earlier paper. Our asymptotic formula provides a link between the complexity of these graphs and the height of associated real tori, and allows us to deduce some corollaries on the complexity thanks to certain results from analytic number theory. In this way we obtain a conjectural relationship between complexity and regular sphere packings.","authors_text":"Anders Karlsson, Gautam Chinta, Jay Jorgenson","cross_cats":["math.CO","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2011-10-31T15:48:49Z","title":"Complexity and heights of tori"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.6841","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:bc8db457a6c67619bf64a3a3533704e9f2c5cdf048d39b8cf9f87c6920eed087","target":"record","created_at":"2026-05-18T04:09:54Z","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":"5b2a72c4caf8130af504f616b31eba19e9f5ac2907cef6805f790b48047b7a1a","cross_cats_sorted":["math.CO","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2011-10-31T15:48:49Z","title_canon_sha256":"12f19dd66b3e9007699a9de00b6c950850e8e1052d38b5e9a826393a89da7f7d"},"schema_version":"1.0","source":{"id":"1110.6841","kind":"arxiv","version":1}},"canonical_sha256":"a347ab0d785f14b3dd2ac3668848d0872cbc2389b9d3114513798baae268d2ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a347ab0d785f14b3dd2ac3668848d0872cbc2389b9d3114513798baae268d2ac","first_computed_at":"2026-05-18T04:09:54.079778Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:54.079778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CQ0X1Wi0tYkHnDCHGpuq8g+1tMpfZ0bhBUboKPDhlO9Oo9/rWkXEKVIWS/zazRCLGn/RuPdLS7coepkRTzCUAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:54.080381Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.6841","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc8db457a6c67619bf64a3a3533704e9f2c5cdf048d39b8cf9f87c6920eed087","sha256:dc4b493064b3bca657e8097cae0c6a353e0625382cd387862b1c33977a0997bd"],"state_sha256":"7cca2bfd8b72e6e504b43c9557cf33fb660281f0d91c3a0ce89ad9ce4df0f68d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d3j6Nn2KXePklKnEpnzZppJJd/rVotiGLUz4/1QKNO9euYM/JE4BccwdX90gpj3uotZyc6z0nGnsFQJhPzglAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:46:20.509475Z","bundle_sha256":"0c557b7f0caa831f6b101c290f23e64508a7cd9c6e5cf3dd83f548d6563b2169"}}