{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IUD2E7P5IL5N2GBS7RM3JEGBZY","short_pith_number":"pith:IUD2E7P5","canonical_record":{"source":{"id":"1501.00168","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-12-31T16:34:34Z","cross_cats_sorted":[],"title_canon_sha256":"b8833e019da05160d4e62f951706cff1f5ae5c567b6124521583e97ab5511730","abstract_canon_sha256":"4125e99292fa3afc468b9b32c650b8e773d2c3e5afca7d9902c539f2ac2f9ec2"},"schema_version":"1.0"},"canonical_sha256":"4507a27dfd42fadd1832fc59b490c1ce20fdb5bb7f80d42c64c3f223e19cc1f5","source":{"kind":"arxiv","id":"1501.00168","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00168","created_at":"2026-05-18T00:21:43Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00168v2","created_at":"2026-05-18T00:21:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00168","created_at":"2026-05-18T00:21:43Z"},{"alias_kind":"pith_short_12","alias_value":"IUD2E7P5IL5N","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IUD2E7P5IL5N2GBS","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IUD2E7P5","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IUD2E7P5IL5N2GBS7RM3JEGBZY","target":"record","payload":{"canonical_record":{"source":{"id":"1501.00168","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-12-31T16:34:34Z","cross_cats_sorted":[],"title_canon_sha256":"b8833e019da05160d4e62f951706cff1f5ae5c567b6124521583e97ab5511730","abstract_canon_sha256":"4125e99292fa3afc468b9b32c650b8e773d2c3e5afca7d9902c539f2ac2f9ec2"},"schema_version":"1.0"},"canonical_sha256":"4507a27dfd42fadd1832fc59b490c1ce20fdb5bb7f80d42c64c3f223e19cc1f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:43.843738Z","signature_b64":"HrTRCjR450koXgdL3x+ulMiIwtQRGlkQDtBmPOe2x/6PYr6+X4IVfVIsn0oJOaTF2+tExqM7fLoYR41llYpODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4507a27dfd42fadd1832fc59b490c1ce20fdb5bb7f80d42c64c3f223e19cc1f5","last_reissued_at":"2026-05-18T00:21:43.843124Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:43.843124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.00168","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-05-18T00:21:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2zUW6FGEDRqN3DX8goRMBwhBrpRbhlU1atYFGpLoUwwkvBsbT/yb6d21S6VC2Gck+3mGV5P8XWDMPqv3u5EdAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:04:28.741848Z"},"content_sha256":"ff32e2af24e54e916954a6088e4b9e06c64737118d289b7228a9587ac3de7dcd","schema_version":"1.0","event_id":"sha256:ff32e2af24e54e916954a6088e4b9e06c64737118d289b7228a9587ac3de7dcd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IUD2E7P5IL5N2GBS7RM3JEGBZY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Better bounds for planar sets avoiding unit distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Fernando M\\'ario de Oliveira Filho, Imre Z. Ruzsa, M\\'at\\'e Matolcsi, Tam\\'as Keleti","submitted_at":"2014-12-31T16:34:34Z","abstract_excerpt":"A $1$-avoiding set is a subset of $\\mathbb{R}^n$ that does not contain pairs of points at distance $1$. Let $m_1(\\mathbb{R}^n)$ denote the maximum fraction of $\\mathbb{R}^n$ that can be covered by a measurable $1$-avoiding set. We prove two results. First, we show that any $1$-avoiding set in $\\mathbb{R}^n$ ($n\\ge 2$) that displays block structure (i.e., is made up of blocks such that the distance between any two points from the same block is less than $1$ and points from distinct blocks lie farther than $1$ unit of distance apart from each other) has density strictly less than $1/2^n$. For th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00168","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":""},"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-18T00:21:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VHctk30816mPi8vIUdyIAByzgloKz4Ma4AaW9MFinMB0lLvnLsh76j/GTB3QqM3urwmON2tDdnfWoXfaLemxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:04:28.742199Z"},"content_sha256":"c5a8176fa40c1a722e5152c7e57a1390783b02c5f69888cbcae9d882e719d6c6","schema_version":"1.0","event_id":"sha256:c5a8176fa40c1a722e5152c7e57a1390783b02c5f69888cbcae9d882e719d6c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUD2E7P5IL5N2GBS7RM3JEGBZY/bundle.json","state_url":"https://pith.science/pith/IUD2E7P5IL5N2GBS7RM3JEGBZY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUD2E7P5IL5N2GBS7RM3JEGBZY/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-01T13:04:28Z","links":{"resolver":"https://pith.science/pith/IUD2E7P5IL5N2GBS7RM3JEGBZY","bundle":"https://pith.science/pith/IUD2E7P5IL5N2GBS7RM3JEGBZY/bundle.json","state":"https://pith.science/pith/IUD2E7P5IL5N2GBS7RM3JEGBZY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUD2E7P5IL5N2GBS7RM3JEGBZY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IUD2E7P5IL5N2GBS7RM3JEGBZY","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":"4125e99292fa3afc468b9b32c650b8e773d2c3e5afca7d9902c539f2ac2f9ec2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-12-31T16:34:34Z","title_canon_sha256":"b8833e019da05160d4e62f951706cff1f5ae5c567b6124521583e97ab5511730"},"schema_version":"1.0","source":{"id":"1501.00168","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00168","created_at":"2026-05-18T00:21:43Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00168v2","created_at":"2026-05-18T00:21:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00168","created_at":"2026-05-18T00:21:43Z"},{"alias_kind":"pith_short_12","alias_value":"IUD2E7P5IL5N","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IUD2E7P5IL5N2GBS","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IUD2E7P5","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:c5a8176fa40c1a722e5152c7e57a1390783b02c5f69888cbcae9d882e719d6c6","target":"graph","created_at":"2026-05-18T00:21:43Z","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 $1$-avoiding set is a subset of $\\mathbb{R}^n$ that does not contain pairs of points at distance $1$. Let $m_1(\\mathbb{R}^n)$ denote the maximum fraction of $\\mathbb{R}^n$ that can be covered by a measurable $1$-avoiding set. We prove two results. First, we show that any $1$-avoiding set in $\\mathbb{R}^n$ ($n\\ge 2$) that displays block structure (i.e., is made up of blocks such that the distance between any two points from the same block is less than $1$ and points from distinct blocks lie farther than $1$ unit of distance apart from each other) has density strictly less than $1/2^n$. For th","authors_text":"Fernando M\\'ario de Oliveira Filho, Imre Z. Ruzsa, M\\'at\\'e Matolcsi, Tam\\'as Keleti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-12-31T16:34:34Z","title":"Better bounds for planar sets avoiding unit distances"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00168","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:ff32e2af24e54e916954a6088e4b9e06c64737118d289b7228a9587ac3de7dcd","target":"record","created_at":"2026-05-18T00:21:43Z","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":"4125e99292fa3afc468b9b32c650b8e773d2c3e5afca7d9902c539f2ac2f9ec2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-12-31T16:34:34Z","title_canon_sha256":"b8833e019da05160d4e62f951706cff1f5ae5c567b6124521583e97ab5511730"},"schema_version":"1.0","source":{"id":"1501.00168","kind":"arxiv","version":2}},"canonical_sha256":"4507a27dfd42fadd1832fc59b490c1ce20fdb5bb7f80d42c64c3f223e19cc1f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4507a27dfd42fadd1832fc59b490c1ce20fdb5bb7f80d42c64c3f223e19cc1f5","first_computed_at":"2026-05-18T00:21:43.843124Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:43.843124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HrTRCjR450koXgdL3x+ulMiIwtQRGlkQDtBmPOe2x/6PYr6+X4IVfVIsn0oJOaTF2+tExqM7fLoYR41llYpODg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:43.843738Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00168","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff32e2af24e54e916954a6088e4b9e06c64737118d289b7228a9587ac3de7dcd","sha256:c5a8176fa40c1a722e5152c7e57a1390783b02c5f69888cbcae9d882e719d6c6"],"state_sha256":"a7e4dcfe9d33bcb096fa47392dad87eb02fd9246d7e15979c4a5fc4a4a70d6b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L8NAaYJwS8j4wYPQ79+hTHigJUMfPUdu88slbMhgti86Ckjjf8ayMKixYZbf+Ljg+8MDZWMhNylos3GMN3wsDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:04:28.744201Z","bundle_sha256":"7be9e7c7b9b06cc01095a51f31e2bdc72fd972adb63fe660494bb5e36800c374"}}