{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:7N447RBGZIHMNCMVNRR533KTPW","short_pith_number":"pith:7N447RBG","schema_version":"1.0","canonical_sha256":"fb79cfc426ca0ec689956c63dded537db4abe2caa248fa0bf9aa7a78e3997cbb","source":{"kind":"arxiv","id":"1111.3768","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1111.3768","created_at":"2026-05-18T04:08:13.090751+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.3768v1","created_at":"2026-05-18T04:08:13.090751+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3768","created_at":"2026-05-18T04:08:13.090751+00:00"},{"alias_kind":"pith_short_12","alias_value":"7N447RBGZIHM","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"7N447RBGZIHMNCMV","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"7N447RBG","created_at":"2026-05-18T12:26:22.705136+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7N447RBGZIHMNCMVNRR533KTPW","json":"https://pith.science/pith/7N447RBGZIHMNCMVNRR533KTPW.json","graph_json":"https://pith.science/api/pith-number/7N447RBGZIHMNCMVNRR533KTPW/graph.json","events_json":"https://pith.science/api/pith-number/7N447RBGZIHMNCMVNRR533KTPW/events.json","paper":"https://pith.science/paper/7N447RBG"},"agent_actions":{"view_html":"https://pith.science/pith/7N447RBGZIHMNCMVNRR533KTPW","download_json":"https://pith.science/pith/7N447RBGZIHMNCMVNRR533KTPW.json","view_paper":"https://pith.science/paper/7N447RBG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.3768&json=true","fetch_graph":"https://pith.science/api/pith-number/7N447RBGZIHMNCMVNRR533KTPW/graph.json","fetch_events":"https://pith.science/api/pith-number/7N447RBGZIHMNCMVNRR533KTPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7N447RBGZIHMNCMVNRR533KTPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7N447RBGZIHMNCMVNRR533KTPW/action/storage_attestation","attest_author":"https://pith.science/pith/7N447RBGZIHMNCMVNRR533KTPW/action/author_attestation","sign_citation":"https://pith.science/pith/7N447RBGZIHMNCMVNRR533KTPW/action/citation_signature","submit_replication":"https://pith.science/pith/7N447RBGZIHMNCMVNRR533KTPW/action/replication_record"}},"created_at":"2026-05-18T04:08:13.090751+00:00","updated_at":"2026-05-18T04:08:13.090751+00:00"}