{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MBWHUUIRXFHX37TX4OFWZARLP3","short_pith_number":"pith:MBWHUUIR","canonical_record":{"source":{"id":"1611.02246","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-07T20:08:47Z","cross_cats_sorted":[],"title_canon_sha256":"ba95a5183d251c8c751a42746e7c90b609b09f234600681d6442c59f7eca3af6","abstract_canon_sha256":"e69dac1aacc4b58c7285d5ea3be3b1935374d16a5545bb411ac08223999d1672"},"schema_version":"1.0"},"canonical_sha256":"606c7a5111b94f7dfe77e38b6c822b7ef691735a75fb6b60dce41c3d7a57fe8c","source":{"kind":"arxiv","id":"1611.02246","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02246","created_at":"2026-07-05T01:23:04Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02246v5","created_at":"2026-07-05T01:23:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02246","created_at":"2026-07-05T01:23:04Z"},{"alias_kind":"pith_short_12","alias_value":"MBWHUUIRXFHX","created_at":"2026-07-05T01:23:04Z"},{"alias_kind":"pith_short_16","alias_value":"MBWHUUIRXFHX37TX","created_at":"2026-07-05T01:23:04Z"},{"alias_kind":"pith_short_8","alias_value":"MBWHUUIR","created_at":"2026-07-05T01:23:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MBWHUUIRXFHX37TX4OFWZARLP3","target":"record","payload":{"canonical_record":{"source":{"id":"1611.02246","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-07T20:08:47Z","cross_cats_sorted":[],"title_canon_sha256":"ba95a5183d251c8c751a42746e7c90b609b09f234600681d6442c59f7eca3af6","abstract_canon_sha256":"e69dac1aacc4b58c7285d5ea3be3b1935374d16a5545bb411ac08223999d1672"},"schema_version":"1.0"},"canonical_sha256":"606c7a5111b94f7dfe77e38b6c822b7ef691735a75fb6b60dce41c3d7a57fe8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:23:04.605599Z","signature_b64":"4cPQYayi7Ls8WiNsb+g0ddHYYi5aiOMZPRLjpiNPM5IRFOELHvYH0mFo3cgzS0WpMs07pGcdFABlP4Whe6PyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"606c7a5111b94f7dfe77e38b6c822b7ef691735a75fb6b60dce41c3d7a57fe8c","last_reissued_at":"2026-07-05T01:23:04.605067Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:23:04.605067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.02246","source_version":5,"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-07-05T01:23:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ydKSdFO9drU2iYPm9iTMyMmVWxY6fMlzDN4JahkltAsBuoBBGuRo/sEtKAml38drBw6wiTio99uTUT4isyABBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T05:35:37.328465Z"},"content_sha256":"3ae89b3e2e95e922db30f01769326d2a7502b357acad4c6375416b643b82665c","schema_version":"1.0","event_id":"sha256:3ae89b3e2e95e922db30f01769326d2a7502b357acad4c6375416b643b82665c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MBWHUUIRXFHX37TX4OFWZARLP3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost all Steiner triple systems have perfect matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Matthew Kwan","submitted_at":"2016-11-07T20:08:47Z","abstract_excerpt":"We show that for any n divisible by 3, almost all order-n Steiner triple systems have a perfect matching (also known as a parallel class or resolution class). In fact, we prove a general upper bound on the number of perfect matchings in a Steiner triple system and show that almost all Steiner triple systems essentially attain this maximum. We accomplish this via a general theorem comparing a uniformly random Steiner triple system to the outcome of the triangle removal process, which we hope will be useful for other problems. Our methods can also be adapted to other types of designs; for exampl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02246","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1611.02246/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:23:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o4/H7mdVO3xhx4NRYDx7aoY8KTIXA2p1JeXVCg1iNMilTw+kyd0uw3BRp7hU6XfeZcnLVHrWgyPdschOMyS4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T05:35:37.329823Z"},"content_sha256":"3a66686b41816ccdd0af55ec8ab79d5959d8070e95e4aadb4574a9b5118e3bc0","schema_version":"1.0","event_id":"sha256:3a66686b41816ccdd0af55ec8ab79d5959d8070e95e4aadb4574a9b5118e3bc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBWHUUIRXFHX37TX4OFWZARLP3/bundle.json","state_url":"https://pith.science/pith/MBWHUUIRXFHX37TX4OFWZARLP3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBWHUUIRXFHX37TX4OFWZARLP3/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-08-17T05:35:37Z","links":{"resolver":"https://pith.science/pith/MBWHUUIRXFHX37TX4OFWZARLP3","bundle":"https://pith.science/pith/MBWHUUIRXFHX37TX4OFWZARLP3/bundle.json","state":"https://pith.science/pith/MBWHUUIRXFHX37TX4OFWZARLP3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBWHUUIRXFHX37TX4OFWZARLP3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MBWHUUIRXFHX37TX4OFWZARLP3","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":"e69dac1aacc4b58c7285d5ea3be3b1935374d16a5545bb411ac08223999d1672","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-07T20:08:47Z","title_canon_sha256":"ba95a5183d251c8c751a42746e7c90b609b09f234600681d6442c59f7eca3af6"},"schema_version":"1.0","source":{"id":"1611.02246","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02246","created_at":"2026-07-05T01:23:04Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02246v5","created_at":"2026-07-05T01:23:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02246","created_at":"2026-07-05T01:23:04Z"},{"alias_kind":"pith_short_12","alias_value":"MBWHUUIRXFHX","created_at":"2026-07-05T01:23:04Z"},{"alias_kind":"pith_short_16","alias_value":"MBWHUUIRXFHX37TX","created_at":"2026-07-05T01:23:04Z"},{"alias_kind":"pith_short_8","alias_value":"MBWHUUIR","created_at":"2026-07-05T01:23:04Z"}],"graph_snapshots":[{"event_id":"sha256:3a66686b41816ccdd0af55ec8ab79d5959d8070e95e4aadb4574a9b5118e3bc0","target":"graph","created_at":"2026-07-05T01:23:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1611.02246/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show that for any n divisible by 3, almost all order-n Steiner triple systems have a perfect matching (also known as a parallel class or resolution class). In fact, we prove a general upper bound on the number of perfect matchings in a Steiner triple system and show that almost all Steiner triple systems essentially attain this maximum. We accomplish this via a general theorem comparing a uniformly random Steiner triple system to the outcome of the triangle removal process, which we hope will be useful for other problems. Our methods can also be adapted to other types of designs; for exampl","authors_text":"Matthew Kwan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-07T20:08:47Z","title":"Almost all Steiner triple systems have perfect matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02246","kind":"arxiv","version":5},"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:3ae89b3e2e95e922db30f01769326d2a7502b357acad4c6375416b643b82665c","target":"record","created_at":"2026-07-05T01:23:04Z","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":"e69dac1aacc4b58c7285d5ea3be3b1935374d16a5545bb411ac08223999d1672","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-07T20:08:47Z","title_canon_sha256":"ba95a5183d251c8c751a42746e7c90b609b09f234600681d6442c59f7eca3af6"},"schema_version":"1.0","source":{"id":"1611.02246","kind":"arxiv","version":5}},"canonical_sha256":"606c7a5111b94f7dfe77e38b6c822b7ef691735a75fb6b60dce41c3d7a57fe8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"606c7a5111b94f7dfe77e38b6c822b7ef691735a75fb6b60dce41c3d7a57fe8c","first_computed_at":"2026-07-05T01:23:04.605067Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:23:04.605067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4cPQYayi7Ls8WiNsb+g0ddHYYi5aiOMZPRLjpiNPM5IRFOELHvYH0mFo3cgzS0WpMs07pGcdFABlP4Whe6PyAw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:23:04.605599Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.02246","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ae89b3e2e95e922db30f01769326d2a7502b357acad4c6375416b643b82665c","sha256:3a66686b41816ccdd0af55ec8ab79d5959d8070e95e4aadb4574a9b5118e3bc0"],"state_sha256":"1416aefec1323f3b8111ade6fe12c22bac72ab09bf74d6ddf2066f5e24834e67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RWm8YxiaaYDbjNqgvvttOq2pPGbPmG3NTXjRl+ZmETuxkK9PfjZTSBRCAWAMYElGmj84swNLnfIT8S0XxGb7CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T05:35:37.340688Z","bundle_sha256":"e5c7dd57cf5bf5f833284b4f4382951c0352c51fb72c2b2cc76f00b7ad7be885"}}