{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:7N447RBGZIHMNCMVNRR533KTPW","short_pith_number":"pith:7N447RBG","canonical_record":{"source":{"id":"1111.3768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-11-16T11:37:23Z","cross_cats_sorted":["math.CO","stat.TH"],"title_canon_sha256":"2cd027a624d85e17203e3aaf483adcbc4963b14fe09bede299ae16688eb77a03","abstract_canon_sha256":"63b20ab40601b8af3ed6484de57c409d5a69ec57db6ac48e7e56bc45e971b73c"},"schema_version":"1.0"},"canonical_sha256":"fb79cfc426ca0ec689956c63dded537db4abe2caa248fa0bf9aa7a78e3997cbb","source":{"kind":"arxiv","id":"1111.3768","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3768","created_at":"2026-05-18T04:08:13Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3768v1","created_at":"2026-05-18T04:08:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3768","created_at":"2026-05-18T04:08:13Z"},{"alias_kind":"pith_short_12","alias_value":"7N447RBGZIHM","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7N447RBGZIHMNCMV","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7N447RBG","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:7N447RBGZIHMNCMVNRR533KTPW","target":"record","payload":{"canonical_record":{"source":{"id":"1111.3768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-11-16T11:37:23Z","cross_cats_sorted":["math.CO","stat.TH"],"title_canon_sha256":"2cd027a624d85e17203e3aaf483adcbc4963b14fe09bede299ae16688eb77a03","abstract_canon_sha256":"63b20ab40601b8af3ed6484de57c409d5a69ec57db6ac48e7e56bc45e971b73c"},"schema_version":"1.0"},"canonical_sha256":"fb79cfc426ca0ec689956c63dded537db4abe2caa248fa0bf9aa7a78e3997cbb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:13.091306Z","signature_b64":"cyfg8ycKYOi2vamk3SaQErfbin+BEexw3pvidvR7LHmQQlfQb6M2iog8hGQQ6aE5RQlImezziVD++1vT5ukEDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb79cfc426ca0ec689956c63dded537db4abe2caa248fa0bf9aa7a78e3997cbb","last_reissued_at":"2026-05-18T04:08:13.090631Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:13.090631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.3768","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:08:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nD9UfYYkiEi84J6p/rSHEfQXy1NakxNT/GJr1/xZT3C46+nThVpN7aSKrzc5eZ/1hoiiKJO6omPTIlYzm5stAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:21:42.982213Z"},"content_sha256":"45b3bc92325288c3dbf925b31a9afad74bf055b33aab24a76725dfa8222fe63f","schema_version":"1.0","event_id":"sha256:45b3bc92325288c3dbf925b31a9afad74bf055b33aab24a76725dfa8222fe63f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:7N447RBGZIHMNCMVNRR533KTPW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using graphs to find the best block designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","stat.TH"],"primary_cat":"math.ST","authors_text":"Peter J. Cameron, R. A. Bailey","submitted_at":"2011-11-16T11:37:23Z","abstract_excerpt":"A statistician designing an experiment wants to get as much information as possible from the data gathered. Often this means the most precise estimate possible (that is, an estimate with minimum possible variance) of the unknown parameters. If there are several parameters, this can be interpreted in many ways: do we want to minimize the average variance, or the maximum variance, or the volume of a confidence region for the parameters?\n  In the case of block designs, these optimality criteria can be calculated from the concurrence graph of the design, and in many cases from its Laplacian eigenv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3768","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:08:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zdm1ehcQWnUouqrxfYPloVU4vEUnPoLvkpbJDSHZfvV0oDmn53ady0KEU/ZG3R3mr+Fn9hcOqQRVxs2jqxqwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:21:42.982892Z"},"content_sha256":"08a3df0aa25523fdc66b820bb39671cc73eeca2322c2f7321d0b66ae23435b8c","schema_version":"1.0","event_id":"sha256:08a3df0aa25523fdc66b820bb39671cc73eeca2322c2f7321d0b66ae23435b8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7N447RBGZIHMNCMVNRR533KTPW/bundle.json","state_url":"https://pith.science/pith/7N447RBGZIHMNCMVNRR533KTPW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7N447RBGZIHMNCMVNRR533KTPW/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-30T09:21:42Z","links":{"resolver":"https://pith.science/pith/7N447RBGZIHMNCMVNRR533KTPW","bundle":"https://pith.science/pith/7N447RBGZIHMNCMVNRR533KTPW/bundle.json","state":"https://pith.science/pith/7N447RBGZIHMNCMVNRR533KTPW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7N447RBGZIHMNCMVNRR533KTPW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7N447RBGZIHMNCMVNRR533KTPW","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":"63b20ab40601b8af3ed6484de57c409d5a69ec57db6ac48e7e56bc45e971b73c","cross_cats_sorted":["math.CO","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-11-16T11:37:23Z","title_canon_sha256":"2cd027a624d85e17203e3aaf483adcbc4963b14fe09bede299ae16688eb77a03"},"schema_version":"1.0","source":{"id":"1111.3768","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3768","created_at":"2026-05-18T04:08:13Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3768v1","created_at":"2026-05-18T04:08:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3768","created_at":"2026-05-18T04:08:13Z"},{"alias_kind":"pith_short_12","alias_value":"7N447RBGZIHM","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7N447RBGZIHMNCMV","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7N447RBG","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:08a3df0aa25523fdc66b820bb39671cc73eeca2322c2f7321d0b66ae23435b8c","target":"graph","created_at":"2026-05-18T04:08:13Z","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":"A statistician designing an experiment wants to get as much information as possible from the data gathered. Often this means the most precise estimate possible (that is, an estimate with minimum possible variance) of the unknown parameters. If there are several parameters, this can be interpreted in many ways: do we want to minimize the average variance, or the maximum variance, or the volume of a confidence region for the parameters?\n  In the case of block designs, these optimality criteria can be calculated from the concurrence graph of the design, and in many cases from its Laplacian eigenv","authors_text":"Peter J. Cameron, R. A. Bailey","cross_cats":["math.CO","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-11-16T11:37:23Z","title":"Using graphs to find the best block designs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3768","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:45b3bc92325288c3dbf925b31a9afad74bf055b33aab24a76725dfa8222fe63f","target":"record","created_at":"2026-05-18T04:08:13Z","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":"63b20ab40601b8af3ed6484de57c409d5a69ec57db6ac48e7e56bc45e971b73c","cross_cats_sorted":["math.CO","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-11-16T11:37:23Z","title_canon_sha256":"2cd027a624d85e17203e3aaf483adcbc4963b14fe09bede299ae16688eb77a03"},"schema_version":"1.0","source":{"id":"1111.3768","kind":"arxiv","version":1}},"canonical_sha256":"fb79cfc426ca0ec689956c63dded537db4abe2caa248fa0bf9aa7a78e3997cbb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb79cfc426ca0ec689956c63dded537db4abe2caa248fa0bf9aa7a78e3997cbb","first_computed_at":"2026-05-18T04:08:13.090631Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:13.090631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cyfg8ycKYOi2vamk3SaQErfbin+BEexw3pvidvR7LHmQQlfQb6M2iog8hGQQ6aE5RQlImezziVD++1vT5ukEDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:13.091306Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.3768","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45b3bc92325288c3dbf925b31a9afad74bf055b33aab24a76725dfa8222fe63f","sha256:08a3df0aa25523fdc66b820bb39671cc73eeca2322c2f7321d0b66ae23435b8c"],"state_sha256":"8e9c73de850f324518a2632364d91ee804ae570f58cb3ba2f798c79ba456b950"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fJ70yO53oSuZ1o1v2WYSzrYCtfxIGyw5DvY5xaBMw80FPKdcPa0SVLR5HZzXSGUmy8uNVs1neuN4QoYqhYCcAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:21:42.986351Z","bundle_sha256":"3e17a33116df0feffd4348df5852a705b3de2393a53d5cac318ee3882510303a"}}