{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:I4I27FOIYQCIKFJCCGO4HXSZLB","short_pith_number":"pith:I4I27FOI","schema_version":"1.0","canonical_sha256":"4711af95c8c404851522119dc3de595862bbd6e2486dce47932bf20a75465c28","source":{"kind":"arxiv","id":"1206.1422","version":2},"attestation_state":"computed","paper":{"title":"The visible perimeter of an arrangement of disks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"G\\'abor Tardos, Gabriel Nivasch, J\\'anos Pach","submitted_at":"2012-06-07T08:28:04Z","abstract_excerpt":"Given a collection of n opaque unit disks in the plane, we want to find a stacking order for them that maximizes their visible perimeter---the total length of all pieces of their boundaries visible from above. We prove that if the centers of the disks form a dense point set, i.e., the ratio of their maximum to their minimum distance is O(n^1/2), then there is a stacking order for which the visible perimeter is Omega(n^2/3). We also show that this bound cannot be improved in the case of a sufficiently small n^1/2 by n^1/2 uniform grid. On the other hand, if the set of centers is dense and the m"},"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":"1206.1422","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-06-07T08:28:04Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a23977f2490eadfac6c9abae3af151effc535655f7d3d0e0879e1681dbbe491b","abstract_canon_sha256":"e34053d912e804e3f40849d1e7e9c8857ecd1a64af581e5f4de24df4bc38b119"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:21.935103Z","signature_b64":"36de40V5OQw+jvQSgM6Ba1wmuvGawa9cuxMRZ79IEsZC1oMAfBRSyntNlveYXq7VJxujZXY/2bB5g/L1NV9RBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4711af95c8c404851522119dc3de595862bbd6e2486dce47932bf20a75465c28","last_reissued_at":"2026-05-18T03:13:21.934345Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:21.934345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The visible perimeter of an arrangement of disks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"G\\'abor Tardos, Gabriel Nivasch, J\\'anos Pach","submitted_at":"2012-06-07T08:28:04Z","abstract_excerpt":"Given a collection of n opaque unit disks in the plane, we want to find a stacking order for them that maximizes their visible perimeter---the total length of all pieces of their boundaries visible from above. We prove that if the centers of the disks form a dense point set, i.e., the ratio of their maximum to their minimum distance is O(n^1/2), then there is a stacking order for which the visible perimeter is Omega(n^2/3). We also show that this bound cannot be improved in the case of a sufficiently small n^1/2 by n^1/2 uniform grid. On the other hand, if the set of centers is dense and the m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1422","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1206.1422","created_at":"2026-05-18T03:13:21.934448+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.1422v2","created_at":"2026-05-18T03:13:21.934448+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1422","created_at":"2026-05-18T03:13:21.934448+00:00"},{"alias_kind":"pith_short_12","alias_value":"I4I27FOIYQCI","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"I4I27FOIYQCIKFJC","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"I4I27FOI","created_at":"2026-05-18T12:27:09.501522+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/I4I27FOIYQCIKFJCCGO4HXSZLB","json":"https://pith.science/pith/I4I27FOIYQCIKFJCCGO4HXSZLB.json","graph_json":"https://pith.science/api/pith-number/I4I27FOIYQCIKFJCCGO4HXSZLB/graph.json","events_json":"https://pith.science/api/pith-number/I4I27FOIYQCIKFJCCGO4HXSZLB/events.json","paper":"https://pith.science/paper/I4I27FOI"},"agent_actions":{"view_html":"https://pith.science/pith/I4I27FOIYQCIKFJCCGO4HXSZLB","download_json":"https://pith.science/pith/I4I27FOIYQCIKFJCCGO4HXSZLB.json","view_paper":"https://pith.science/paper/I4I27FOI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.1422&json=true","fetch_graph":"https://pith.science/api/pith-number/I4I27FOIYQCIKFJCCGO4HXSZLB/graph.json","fetch_events":"https://pith.science/api/pith-number/I4I27FOIYQCIKFJCCGO4HXSZLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I4I27FOIYQCIKFJCCGO4HXSZLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I4I27FOIYQCIKFJCCGO4HXSZLB/action/storage_attestation","attest_author":"https://pith.science/pith/I4I27FOIYQCIKFJCCGO4HXSZLB/action/author_attestation","sign_citation":"https://pith.science/pith/I4I27FOIYQCIKFJCCGO4HXSZLB/action/citation_signature","submit_replication":"https://pith.science/pith/I4I27FOIYQCIKFJCCGO4HXSZLB/action/replication_record"}},"created_at":"2026-05-18T03:13:21.934448+00:00","updated_at":"2026-05-18T03:13:21.934448+00:00"}