{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JCQKMZ2FGRUNLX4ZNURFOQPBL6","short_pith_number":"pith:JCQKMZ2F","canonical_record":{"source":{"id":"1210.6340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-23T19:47:15Z","cross_cats_sorted":[],"title_canon_sha256":"28a98268a70f9141100389a868ae30afaab1b47d97460e8582346ca9fde45f83","abstract_canon_sha256":"053a78876bd4caad49515f31ccc308930df76abc634b8bc4bc0321133457f402"},"schema_version":"1.0"},"canonical_sha256":"48a0a667453468d5df996d225741e15fa1af979d997987e9f4f3f129a7308d73","source":{"kind":"arxiv","id":"1210.6340","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6340","created_at":"2026-05-18T03:42:32Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6340v1","created_at":"2026-05-18T03:42:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6340","created_at":"2026-05-18T03:42:32Z"},{"alias_kind":"pith_short_12","alias_value":"JCQKMZ2FGRUN","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JCQKMZ2FGRUNLX4Z","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JCQKMZ2F","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JCQKMZ2FGRUNLX4ZNURFOQPBL6","target":"record","payload":{"canonical_record":{"source":{"id":"1210.6340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-23T19:47:15Z","cross_cats_sorted":[],"title_canon_sha256":"28a98268a70f9141100389a868ae30afaab1b47d97460e8582346ca9fde45f83","abstract_canon_sha256":"053a78876bd4caad49515f31ccc308930df76abc634b8bc4bc0321133457f402"},"schema_version":"1.0"},"canonical_sha256":"48a0a667453468d5df996d225741e15fa1af979d997987e9f4f3f129a7308d73","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:32.657015Z","signature_b64":"oO31br5f//2s858aGAKoz36x4Vvq4ewNBXdc12UTIAcsjIkqLiG7X7/DewBiJHz9RbQnuU27K0bDLAA9KkEuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48a0a667453468d5df996d225741e15fa1af979d997987e9f4f3f129a7308d73","last_reissued_at":"2026-05-18T03:42:32.656488Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:32.656488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.6340","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-18T03:42:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4AMp7eWpzp0oscArVECBIsCWrlMQQ9fDULHZe0iMLFfEuVVI5m5dHFly8ZB5qPvLVG5CMQDL3HqOg34G/gR5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:11:41.063431Z"},"content_sha256":"72eb363f93a44e90779ec2cdc5b13949f25268c447f1edfb8560cf517d5f18f1","schema_version":"1.0","event_id":"sha256:72eb363f93a44e90779ec2cdc5b13949f25268c447f1edfb8560cf517d5f18f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JCQKMZ2FGRUNLX4ZNURFOQPBL6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sharp upper and lower bounds on the number of spanning trees in Cartesian product of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jernej Azarija","submitted_at":"2012-10-23T19:47:15Z","abstract_excerpt":"Let $G_1$ and $G_2$ be simple graphs and let $n_1 = |V(G_1)|$, $m_1 = |E(G_1)|$, $n_2 = |V(G_2)|$ and $m_2 = |E(G_2)|.$ In this paper we derive sharp upper and lower bounds for the number of spanning trees $\\tau$ in the Cartesian product $G_1 \\square G_2$ of $G_1$ and $G_2$. We show that: $$ \\tau(G_1 \\square G_2) \\geq \\frac{2^{(n_1-1)(n_2-1)}}{n_1n_2} (\\tau(G_1) n_1)^{\\frac{n_2+1}{2}} (\\tau(G_2)n_2)^{\\frac{n_1+1}{2}}$$ and $$\\tau(G_1 \\square G_2) \\leq \\tau(G_1)\\tau(G_2) [\\frac{2m_1}{n_1-1} + \\frac{2m_2}{n_2-1}]^{(n_1-1)(n_2-1)}.$$ We also characterize the graphs for which equality holds. As a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6340","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-18T03:42:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tr1/NXXnFY1EA6dnJSzBDJAN0dPNO3ZwRfm4iTKFF+LxYZWSHUjP1sM8OYwZBIreCR7T66yp030v3MQgg4kRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:11:41.063794Z"},"content_sha256":"ca57a25e338a8f88acdce54bde28154b508989e098965b03f5ac5a80f43b234c","schema_version":"1.0","event_id":"sha256:ca57a25e338a8f88acdce54bde28154b508989e098965b03f5ac5a80f43b234c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JCQKMZ2FGRUNLX4ZNURFOQPBL6/bundle.json","state_url":"https://pith.science/pith/JCQKMZ2FGRUNLX4ZNURFOQPBL6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JCQKMZ2FGRUNLX4ZNURFOQPBL6/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-07T06:11:41Z","links":{"resolver":"https://pith.science/pith/JCQKMZ2FGRUNLX4ZNURFOQPBL6","bundle":"https://pith.science/pith/JCQKMZ2FGRUNLX4ZNURFOQPBL6/bundle.json","state":"https://pith.science/pith/JCQKMZ2FGRUNLX4ZNURFOQPBL6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JCQKMZ2FGRUNLX4ZNURFOQPBL6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JCQKMZ2FGRUNLX4ZNURFOQPBL6","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":"053a78876bd4caad49515f31ccc308930df76abc634b8bc4bc0321133457f402","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-23T19:47:15Z","title_canon_sha256":"28a98268a70f9141100389a868ae30afaab1b47d97460e8582346ca9fde45f83"},"schema_version":"1.0","source":{"id":"1210.6340","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6340","created_at":"2026-05-18T03:42:32Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6340v1","created_at":"2026-05-18T03:42:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6340","created_at":"2026-05-18T03:42:32Z"},{"alias_kind":"pith_short_12","alias_value":"JCQKMZ2FGRUN","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JCQKMZ2FGRUNLX4Z","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JCQKMZ2F","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:ca57a25e338a8f88acdce54bde28154b508989e098965b03f5ac5a80f43b234c","target":"graph","created_at":"2026-05-18T03:42:32Z","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":"Let $G_1$ and $G_2$ be simple graphs and let $n_1 = |V(G_1)|$, $m_1 = |E(G_1)|$, $n_2 = |V(G_2)|$ and $m_2 = |E(G_2)|.$ In this paper we derive sharp upper and lower bounds for the number of spanning trees $\\tau$ in the Cartesian product $G_1 \\square G_2$ of $G_1$ and $G_2$. We show that: $$ \\tau(G_1 \\square G_2) \\geq \\frac{2^{(n_1-1)(n_2-1)}}{n_1n_2} (\\tau(G_1) n_1)^{\\frac{n_2+1}{2}} (\\tau(G_2)n_2)^{\\frac{n_1+1}{2}}$$ and $$\\tau(G_1 \\square G_2) \\leq \\tau(G_1)\\tau(G_2) [\\frac{2m_1}{n_1-1} + \\frac{2m_2}{n_2-1}]^{(n_1-1)(n_2-1)}.$$ We also characterize the graphs for which equality holds. As a ","authors_text":"Jernej Azarija","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-23T19:47:15Z","title":"Sharp upper and lower bounds on the number of spanning trees in Cartesian product of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6340","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:72eb363f93a44e90779ec2cdc5b13949f25268c447f1edfb8560cf517d5f18f1","target":"record","created_at":"2026-05-18T03:42:32Z","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":"053a78876bd4caad49515f31ccc308930df76abc634b8bc4bc0321133457f402","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-23T19:47:15Z","title_canon_sha256":"28a98268a70f9141100389a868ae30afaab1b47d97460e8582346ca9fde45f83"},"schema_version":"1.0","source":{"id":"1210.6340","kind":"arxiv","version":1}},"canonical_sha256":"48a0a667453468d5df996d225741e15fa1af979d997987e9f4f3f129a7308d73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48a0a667453468d5df996d225741e15fa1af979d997987e9f4f3f129a7308d73","first_computed_at":"2026-05-18T03:42:32.656488Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:32.656488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oO31br5f//2s858aGAKoz36x4Vvq4ewNBXdc12UTIAcsjIkqLiG7X7/DewBiJHz9RbQnuU27K0bDLAA9KkEuCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:32.657015Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.6340","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72eb363f93a44e90779ec2cdc5b13949f25268c447f1edfb8560cf517d5f18f1","sha256:ca57a25e338a8f88acdce54bde28154b508989e098965b03f5ac5a80f43b234c"],"state_sha256":"e71be89045fc3b219d62eae29b1d1fc157f0a4f0b161911e96b8c835273365c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZOZqsCqz96qBRYUj2OStg2ztWxJAZ4A2CmUp/gA8p5GHTyxbQpIglFhnY8jShJsb7okUJXsgTQK5Tct2MYydAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T06:11:41.066485Z","bundle_sha256":"1d0d3244f8ab4786cf19112cba6168d580b7edddc00b667a1d991c9fc46bb4f0"}}