{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QSPTB7QT24V3XRYF6HJUAVXZJX","short_pith_number":"pith:QSPTB7QT","canonical_record":{"source":{"id":"1108.5042","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-25T08:50:40Z","cross_cats_sorted":[],"title_canon_sha256":"fb2fd41f502ca679067af19680b8604d83550b98ec0b6f01896897e0d8056074","abstract_canon_sha256":"fbcee982184fea6d6ed00da2a003c8caae2ab9d0b9e4e0d6117933141d436644"},"schema_version":"1.0"},"canonical_sha256":"849f30fe13d72bbbc705f1d34056f94de2900458d2b73d4d3a1672df373d93f8","source":{"kind":"arxiv","id":"1108.5042","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.5042","created_at":"2026-05-18T04:11:08Z"},{"alias_kind":"arxiv_version","alias_value":"1108.5042v3","created_at":"2026-05-18T04:11:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5042","created_at":"2026-05-18T04:11:08Z"},{"alias_kind":"pith_short_12","alias_value":"QSPTB7QT24V3","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QSPTB7QT24V3XRYF","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QSPTB7QT","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QSPTB7QT24V3XRYF6HJUAVXZJX","target":"record","payload":{"canonical_record":{"source":{"id":"1108.5042","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-25T08:50:40Z","cross_cats_sorted":[],"title_canon_sha256":"fb2fd41f502ca679067af19680b8604d83550b98ec0b6f01896897e0d8056074","abstract_canon_sha256":"fbcee982184fea6d6ed00da2a003c8caae2ab9d0b9e4e0d6117933141d436644"},"schema_version":"1.0"},"canonical_sha256":"849f30fe13d72bbbc705f1d34056f94de2900458d2b73d4d3a1672df373d93f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:08.224418Z","signature_b64":"Ozk9Ttub1gpZgj06uhJXc1vqKXPc82o35wXQ6EJ+Odwit1qS7eYto3zsmGxR2t2fQHdzbkeM7QdtSg/s/lBWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"849f30fe13d72bbbc705f1d34056f94de2900458d2b73d4d3a1672df373d93f8","last_reissued_at":"2026-05-18T04:11:08.223887Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:08.223887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.5042","source_version":3,"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:11:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+zNpgkaPsDnUUTSHAsDArMFmSaVfFhztPssVEs3gNJ6Vd+X+uzRuVP/HAq9B/b+FXDKIShmA9IRav+PTkYbDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:59:47.006121Z"},"content_sha256":"466bc3e6f6e8cbdbd84cf22a528567e990ced5a89e596b9dc8c1e02ae89b89e9","schema_version":"1.0","event_id":"sha256:466bc3e6f6e8cbdbd84cf22a528567e990ced5a89e596b9dc8c1e02ae89b89e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QSPTB7QT24V3XRYF6HJUAVXZJX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Upper bound on the number of Steiner triple systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nathan Linial, Zur Luria","submitted_at":"2011-08-25T08:50:40Z","abstract_excerpt":"Let STS(n) denote the number of Steiner triple systems on n vertices, and let F(n) denote the number of 1-factorizations of the complete graph on n vertices. We prove the following upper bound.\n  STS(n) <= ((1 + o(1)) (n/e^2))^(n^2/6)\n  F(n) <= ((1 + o(1)) (n/e^2))^(n^2/2)\n  We conjecture that the bound is sharp. Our main tool is the entropy method."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5042","kind":"arxiv","version":3},"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:11:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oTJQJ7EfLaHrNB7sbN7eTh7C6tOEBMYLhR2xIXYqK69ACa24KN9EvMKhG8DmHtQt1HnRyzDLNLjCTMSa+A2mCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:59:47.006476Z"},"content_sha256":"74dd72d321e0c1c716fa57a2fd210ccddd14a2fc548b764147da7736292a99db","schema_version":"1.0","event_id":"sha256:74dd72d321e0c1c716fa57a2fd210ccddd14a2fc548b764147da7736292a99db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QSPTB7QT24V3XRYF6HJUAVXZJX/bundle.json","state_url":"https://pith.science/pith/QSPTB7QT24V3XRYF6HJUAVXZJX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QSPTB7QT24V3XRYF6HJUAVXZJX/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-02T20:59:47Z","links":{"resolver":"https://pith.science/pith/QSPTB7QT24V3XRYF6HJUAVXZJX","bundle":"https://pith.science/pith/QSPTB7QT24V3XRYF6HJUAVXZJX/bundle.json","state":"https://pith.science/pith/QSPTB7QT24V3XRYF6HJUAVXZJX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QSPTB7QT24V3XRYF6HJUAVXZJX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QSPTB7QT24V3XRYF6HJUAVXZJX","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":"fbcee982184fea6d6ed00da2a003c8caae2ab9d0b9e4e0d6117933141d436644","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-25T08:50:40Z","title_canon_sha256":"fb2fd41f502ca679067af19680b8604d83550b98ec0b6f01896897e0d8056074"},"schema_version":"1.0","source":{"id":"1108.5042","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.5042","created_at":"2026-05-18T04:11:08Z"},{"alias_kind":"arxiv_version","alias_value":"1108.5042v3","created_at":"2026-05-18T04:11:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5042","created_at":"2026-05-18T04:11:08Z"},{"alias_kind":"pith_short_12","alias_value":"QSPTB7QT24V3","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QSPTB7QT24V3XRYF","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QSPTB7QT","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:74dd72d321e0c1c716fa57a2fd210ccddd14a2fc548b764147da7736292a99db","target":"graph","created_at":"2026-05-18T04:11: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":"Let STS(n) denote the number of Steiner triple systems on n vertices, and let F(n) denote the number of 1-factorizations of the complete graph on n vertices. We prove the following upper bound.\n  STS(n) <= ((1 + o(1)) (n/e^2))^(n^2/6)\n  F(n) <= ((1 + o(1)) (n/e^2))^(n^2/2)\n  We conjecture that the bound is sharp. Our main tool is the entropy method.","authors_text":"Nathan Linial, Zur Luria","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-25T08:50:40Z","title":"An Upper bound on the number of Steiner triple systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5042","kind":"arxiv","version":3},"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:466bc3e6f6e8cbdbd84cf22a528567e990ced5a89e596b9dc8c1e02ae89b89e9","target":"record","created_at":"2026-05-18T04:11: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":"fbcee982184fea6d6ed00da2a003c8caae2ab9d0b9e4e0d6117933141d436644","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-25T08:50:40Z","title_canon_sha256":"fb2fd41f502ca679067af19680b8604d83550b98ec0b6f01896897e0d8056074"},"schema_version":"1.0","source":{"id":"1108.5042","kind":"arxiv","version":3}},"canonical_sha256":"849f30fe13d72bbbc705f1d34056f94de2900458d2b73d4d3a1672df373d93f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"849f30fe13d72bbbc705f1d34056f94de2900458d2b73d4d3a1672df373d93f8","first_computed_at":"2026-05-18T04:11:08.223887Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:08.223887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ozk9Ttub1gpZgj06uhJXc1vqKXPc82o35wXQ6EJ+Odwit1qS7eYto3zsmGxR2t2fQHdzbkeM7QdtSg/s/lBWAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:08.224418Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.5042","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:466bc3e6f6e8cbdbd84cf22a528567e990ced5a89e596b9dc8c1e02ae89b89e9","sha256:74dd72d321e0c1c716fa57a2fd210ccddd14a2fc548b764147da7736292a99db"],"state_sha256":"734002e62e849d93d01493c82bb1f8076a9690c19ae4b97808e3e3256623a556"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z7OL/P2PxnEZTyToB435t+gA4oWh9YOpJie3TGWZqvHK4aH/lF+U85H0dYbfzDzcAoAa/6SX0DIJ0weEe0LQCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:59:47.008782Z","bundle_sha256":"1e5e6f60bb322d53ecdc8850787844b933e39e45c6b3092f5f65d4a96bef75c7"}}