{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:S7UQRDI4C65XUUDDC4HSBOHIYP","short_pith_number":"pith:S7UQRDI4","canonical_record":{"source":{"id":"1210.6335","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-23T19:34:26Z","cross_cats_sorted":[],"title_canon_sha256":"113b179c264827f9e24315b9a32aea7f731ec599a794e7ac6399c8c797f57221","abstract_canon_sha256":"bbd30b9c567fecb491da7b22e8669344c63118c027c83f40aa831fd7b2423787"},"schema_version":"1.0"},"canonical_sha256":"97e9088d1c17bb7a5063170f20b8e8c3c77a12878acb310316d1680fefd49f45","source":{"kind":"arxiv","id":"1210.6335","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6335","created_at":"2026-05-18T03:34:02Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6335v2","created_at":"2026-05-18T03:34:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6335","created_at":"2026-05-18T03:34:02Z"},{"alias_kind":"pith_short_12","alias_value":"S7UQRDI4C65X","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"S7UQRDI4C65XUUDD","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"S7UQRDI4","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:S7UQRDI4C65XUUDDC4HSBOHIYP","target":"record","payload":{"canonical_record":{"source":{"id":"1210.6335","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-23T19:34:26Z","cross_cats_sorted":[],"title_canon_sha256":"113b179c264827f9e24315b9a32aea7f731ec599a794e7ac6399c8c797f57221","abstract_canon_sha256":"bbd30b9c567fecb491da7b22e8669344c63118c027c83f40aa831fd7b2423787"},"schema_version":"1.0"},"canonical_sha256":"97e9088d1c17bb7a5063170f20b8e8c3c77a12878acb310316d1680fefd49f45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:02.792379Z","signature_b64":"ubkGwPkIRght4SNdC65g/NZYzeWWKfl0lKKoCGnRzsy+ARQ+/odo/s8gI2t2xxIA6x7n7Y8fu54F9KsJxcItAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97e9088d1c17bb7a5063170f20b8e8c3c77a12878acb310316d1680fefd49f45","last_reissued_at":"2026-05-18T03:34:02.791803Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:02.791803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.6335","source_version":2,"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:34:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K/Y+ueTh7h8gf7uP6jJne9t4MAQxsoPSdGiIqPjru279m98ZMsT5c3VrEyhi5m+Orv7rh3UbJl4dBMDxEG6cDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:12:18.845523Z"},"content_sha256":"bd66154c1e6c5a1e13d19cf8ec4b074281c5d15cf7b8eb646cb0f22c8ec645c8","schema_version":"1.0","event_id":"sha256:bd66154c1e6c5a1e13d19cf8ec4b074281c5d15cf7b8eb646cb0f22c8ec645c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:S7UQRDI4C65XUUDDC4HSBOHIYP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Euler's idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jernej Azarija, Riste \\v{S}krekovski","submitted_at":"2012-10-23T19:34:26Z","abstract_excerpt":"Let $\\alpha(n)$ be the least number $k$ for which there exists a simple graph with $k$ vertices having precisely $n \\geq 3$ spanning trees. Similarly, define $\\beta(n)$ as the least number $k$ for which there exists a simple graph with $k$ edges having precisely $n \\geq 3$ spanning trees. As an $n$-cycle has exactly $n$ spanning trees, it follows that $\\alpha(n),\\beta(n) \\leq n$. In this paper, we show that $\\alpha(n) \\leq \\frac{n+4}{3}$ and $\\beta(n) \\leq \\frac{n+7}{3} $ if and only if $n \\notin {3,4,5,6,7,9,10,13,18,22}$, which is a subset of Euler's idoneal numbers. Moreover, if $n \\not \\eq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6335","kind":"arxiv","version":2},"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:34:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FksBj4+tDnZ+hWMdSmBrGPjAh3eKK0LRsuTm7nLX4soX/aqwo64bBeA0hKOJovc1L7Tqatu7femQddfxLwTYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:12:18.846178Z"},"content_sha256":"385b51b891ba2d5fcb9973e86da819c9490e8b42c78c2ecab297e96b09d3a809","schema_version":"1.0","event_id":"sha256:385b51b891ba2d5fcb9973e86da819c9490e8b42c78c2ecab297e96b09d3a809"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S7UQRDI4C65XUUDDC4HSBOHIYP/bundle.json","state_url":"https://pith.science/pith/S7UQRDI4C65XUUDDC4HSBOHIYP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S7UQRDI4C65XUUDDC4HSBOHIYP/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:12:18Z","links":{"resolver":"https://pith.science/pith/S7UQRDI4C65XUUDDC4HSBOHIYP","bundle":"https://pith.science/pith/S7UQRDI4C65XUUDDC4HSBOHIYP/bundle.json","state":"https://pith.science/pith/S7UQRDI4C65XUUDDC4HSBOHIYP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S7UQRDI4C65XUUDDC4HSBOHIYP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:S7UQRDI4C65XUUDDC4HSBOHIYP","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":"bbd30b9c567fecb491da7b22e8669344c63118c027c83f40aa831fd7b2423787","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-23T19:34:26Z","title_canon_sha256":"113b179c264827f9e24315b9a32aea7f731ec599a794e7ac6399c8c797f57221"},"schema_version":"1.0","source":{"id":"1210.6335","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6335","created_at":"2026-05-18T03:34:02Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6335v2","created_at":"2026-05-18T03:34:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6335","created_at":"2026-05-18T03:34:02Z"},{"alias_kind":"pith_short_12","alias_value":"S7UQRDI4C65X","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"S7UQRDI4C65XUUDD","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"S7UQRDI4","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:385b51b891ba2d5fcb9973e86da819c9490e8b42c78c2ecab297e96b09d3a809","target":"graph","created_at":"2026-05-18T03:34:02Z","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 $\\alpha(n)$ be the least number $k$ for which there exists a simple graph with $k$ vertices having precisely $n \\geq 3$ spanning trees. Similarly, define $\\beta(n)$ as the least number $k$ for which there exists a simple graph with $k$ edges having precisely $n \\geq 3$ spanning trees. As an $n$-cycle has exactly $n$ spanning trees, it follows that $\\alpha(n),\\beta(n) \\leq n$. In this paper, we show that $\\alpha(n) \\leq \\frac{n+4}{3}$ and $\\beta(n) \\leq \\frac{n+7}{3} $ if and only if $n \\notin {3,4,5,6,7,9,10,13,18,22}$, which is a subset of Euler's idoneal numbers. Moreover, if $n \\not \\eq","authors_text":"Jernej Azarija, Riste \\v{S}krekovski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-23T19:34:26Z","title":"Euler's idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6335","kind":"arxiv","version":2},"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:bd66154c1e6c5a1e13d19cf8ec4b074281c5d15cf7b8eb646cb0f22c8ec645c8","target":"record","created_at":"2026-05-18T03:34:02Z","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":"bbd30b9c567fecb491da7b22e8669344c63118c027c83f40aa831fd7b2423787","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-23T19:34:26Z","title_canon_sha256":"113b179c264827f9e24315b9a32aea7f731ec599a794e7ac6399c8c797f57221"},"schema_version":"1.0","source":{"id":"1210.6335","kind":"arxiv","version":2}},"canonical_sha256":"97e9088d1c17bb7a5063170f20b8e8c3c77a12878acb310316d1680fefd49f45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97e9088d1c17bb7a5063170f20b8e8c3c77a12878acb310316d1680fefd49f45","first_computed_at":"2026-05-18T03:34:02.791803Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:02.791803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ubkGwPkIRght4SNdC65g/NZYzeWWKfl0lKKoCGnRzsy+ARQ+/odo/s8gI2t2xxIA6x7n7Y8fu54F9KsJxcItAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:02.792379Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.6335","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd66154c1e6c5a1e13d19cf8ec4b074281c5d15cf7b8eb646cb0f22c8ec645c8","sha256:385b51b891ba2d5fcb9973e86da819c9490e8b42c78c2ecab297e96b09d3a809"],"state_sha256":"925dbc311150c699519c6738392e975fb3f2cc0888f479051b52ad28c15aad56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jx36AtWI4YdfGwdEFIW7kbH93eg3CNsLTHGJLD/mk9Qg6vTd8fVbA0eh6OZ4dQjDCgVe5UQ0Jm1ULWajlIJRAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T06:12:18.849827Z","bundle_sha256":"9425e5d8ee06e22db592ed374925c75e3fe9b9feff212d7df933c53bab016155"}}