{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5OZ7KHDXW5WOVF2PWXDQHFZYIS","short_pith_number":"pith:5OZ7KHDX","canonical_record":{"source":{"id":"1908.01267","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-04T03:43:07Z","cross_cats_sorted":[],"title_canon_sha256":"48b9c7ae998e784bd982422ffc00905f00c8cacf731fd7c20abe1a185022f69c","abstract_canon_sha256":"e7d85c2f7b7051d04243042f2708273d3bfbc242bf04fb44faa1c3bba7d4edc0"},"schema_version":"1.0"},"canonical_sha256":"ebb3f51c77b76cea974fb5c7039738449fba5893a61757e3c1ed9834576bb283","source":{"kind":"arxiv","id":"1908.01267","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01267","created_at":"2026-07-05T01:13:23Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01267v2","created_at":"2026-07-05T01:13:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01267","created_at":"2026-07-05T01:13:23Z"},{"alias_kind":"pith_short_12","alias_value":"5OZ7KHDXW5WO","created_at":"2026-07-05T01:13:23Z"},{"alias_kind":"pith_short_16","alias_value":"5OZ7KHDXW5WOVF2P","created_at":"2026-07-05T01:13:23Z"},{"alias_kind":"pith_short_8","alias_value":"5OZ7KHDX","created_at":"2026-07-05T01:13:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5OZ7KHDXW5WOVF2PWXDQHFZYIS","target":"record","payload":{"canonical_record":{"source":{"id":"1908.01267","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-04T03:43:07Z","cross_cats_sorted":[],"title_canon_sha256":"48b9c7ae998e784bd982422ffc00905f00c8cacf731fd7c20abe1a185022f69c","abstract_canon_sha256":"e7d85c2f7b7051d04243042f2708273d3bfbc242bf04fb44faa1c3bba7d4edc0"},"schema_version":"1.0"},"canonical_sha256":"ebb3f51c77b76cea974fb5c7039738449fba5893a61757e3c1ed9834576bb283","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:13:23.310602Z","signature_b64":"mAsOZOjpl26NKmiK09bGNGTnCAaVU7K5Ak18hPSkcVVXes0Kb7mP3DnIzrbJVXYwDW11tEnPEqzZC+Q9dKs2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebb3f51c77b76cea974fb5c7039738449fba5893a61757e3c1ed9834576bb283","last_reissued_at":"2026-07-05T01:13:23.310193Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:13:23.310193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.01267","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-07-05T01:13:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ADWesSgmMKaLiqN34/ZIsMgy+OLc8AaeaIpAL3Fk4aqwIzleECPAJBfZ4flDP/hVMtnzOI+8Sw+TEui/BFEWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T23:28:43.890793Z"},"content_sha256":"a587adf551d2234fac865a66da61198e3dcff043da81ffa29b4d4afb175c644e","schema_version":"1.0","event_id":"sha256:a587adf551d2234fac865a66da61198e3dcff043da81ffa29b4d4afb175c644e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5OZ7KHDXW5WOVF2PWXDQHFZYIS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Most binary matrices have no small defining set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anita Liebenau, Carly Bodkin, Ian M. Wanless","submitted_at":"2019-08-04T03:43:07Z","abstract_excerpt":"Consider a matrix $M$ chosen uniformly at random from a class of $m \\times n$ matrices of zeros and ones with prescribed row and column sums. A partially filled matrix $D$ is a $\\mathit{defining}$ $\\mathit{set}$ for $M$ if $M$ is the unique member of its class that contains the entries in $D$. The $\\mathit{size}$ of a defining set is the number of filled entries. A $\\mathit{critical}$ $\\mathit{set}$ is a defining set for which the removal of any entry stops it being a defining set. For some small fixed $\\epsilon>0$, we assume that $n\\le m=o(n^{1+\\epsilon})$, and that $\\lambda\\le1/2$, where $\\l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01267","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.01267/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:13:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kXz6lTv+nDFBj0exvnI5VZWltHNJF3TJVCK5nXEfSR61edd/DyTQQGZxIKIaJfe/0nPo0x0WJjS5FMgPZ24jDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T23:28:43.891387Z"},"content_sha256":"c3ef64e229d7be1e7e235b569310286f6f2323367149c1f181930816fac6e809","schema_version":"1.0","event_id":"sha256:c3ef64e229d7be1e7e235b569310286f6f2323367149c1f181930816fac6e809"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5OZ7KHDXW5WOVF2PWXDQHFZYIS/bundle.json","state_url":"https://pith.science/pith/5OZ7KHDXW5WOVF2PWXDQHFZYIS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5OZ7KHDXW5WOVF2PWXDQHFZYIS/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-16T23:28:43Z","links":{"resolver":"https://pith.science/pith/5OZ7KHDXW5WOVF2PWXDQHFZYIS","bundle":"https://pith.science/pith/5OZ7KHDXW5WOVF2PWXDQHFZYIS/bundle.json","state":"https://pith.science/pith/5OZ7KHDXW5WOVF2PWXDQHFZYIS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5OZ7KHDXW5WOVF2PWXDQHFZYIS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5OZ7KHDXW5WOVF2PWXDQHFZYIS","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":"e7d85c2f7b7051d04243042f2708273d3bfbc242bf04fb44faa1c3bba7d4edc0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-04T03:43:07Z","title_canon_sha256":"48b9c7ae998e784bd982422ffc00905f00c8cacf731fd7c20abe1a185022f69c"},"schema_version":"1.0","source":{"id":"1908.01267","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01267","created_at":"2026-07-05T01:13:23Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01267v2","created_at":"2026-07-05T01:13:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01267","created_at":"2026-07-05T01:13:23Z"},{"alias_kind":"pith_short_12","alias_value":"5OZ7KHDXW5WO","created_at":"2026-07-05T01:13:23Z"},{"alias_kind":"pith_short_16","alias_value":"5OZ7KHDXW5WOVF2P","created_at":"2026-07-05T01:13:23Z"},{"alias_kind":"pith_short_8","alias_value":"5OZ7KHDX","created_at":"2026-07-05T01:13:23Z"}],"graph_snapshots":[{"event_id":"sha256:c3ef64e229d7be1e7e235b569310286f6f2323367149c1f181930816fac6e809","target":"graph","created_at":"2026-07-05T01:13:23Z","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/1908.01267/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Consider a matrix $M$ chosen uniformly at random from a class of $m \\times n$ matrices of zeros and ones with prescribed row and column sums. A partially filled matrix $D$ is a $\\mathit{defining}$ $\\mathit{set}$ for $M$ if $M$ is the unique member of its class that contains the entries in $D$. The $\\mathit{size}$ of a defining set is the number of filled entries. A $\\mathit{critical}$ $\\mathit{set}$ is a defining set for which the removal of any entry stops it being a defining set. For some small fixed $\\epsilon>0$, we assume that $n\\le m=o(n^{1+\\epsilon})$, and that $\\lambda\\le1/2$, where $\\l","authors_text":"Anita Liebenau, Carly Bodkin, Ian M. Wanless","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-04T03:43:07Z","title":"Most binary matrices have no small defining set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01267","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:a587adf551d2234fac865a66da61198e3dcff043da81ffa29b4d4afb175c644e","target":"record","created_at":"2026-07-05T01:13:23Z","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":"e7d85c2f7b7051d04243042f2708273d3bfbc242bf04fb44faa1c3bba7d4edc0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-04T03:43:07Z","title_canon_sha256":"48b9c7ae998e784bd982422ffc00905f00c8cacf731fd7c20abe1a185022f69c"},"schema_version":"1.0","source":{"id":"1908.01267","kind":"arxiv","version":2}},"canonical_sha256":"ebb3f51c77b76cea974fb5c7039738449fba5893a61757e3c1ed9834576bb283","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ebb3f51c77b76cea974fb5c7039738449fba5893a61757e3c1ed9834576bb283","first_computed_at":"2026-07-05T01:13:23.310193Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:13:23.310193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mAsOZOjpl26NKmiK09bGNGTnCAaVU7K5Ak18hPSkcVVXes0Kb7mP3DnIzrbJVXYwDW11tEnPEqzZC+Q9dKs2AA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:13:23.310602Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.01267","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a587adf551d2234fac865a66da61198e3dcff043da81ffa29b4d4afb175c644e","sha256:c3ef64e229d7be1e7e235b569310286f6f2323367149c1f181930816fac6e809"],"state_sha256":"6b1d0ba043b53ec379f0c9a4b62622a0961041b798435ce7d4ef8a73789ea3f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QBJ2xUBo6hwtwOXKuPTVyg8DSpTnEWMovS3JdmHNuXJhNbv3w8h6Ai2AzFq3zN+KjmXU8aT7y0s99NbKhrN8Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T23:28:43.897125Z","bundle_sha256":"d225e5d0c50ed33ba2a0a3ea67b9c503d2a54b8c553be3abf37949ae325f84fa"}}