{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KB5YVM3M2XK23E6DY5EF5GJB3W","short_pith_number":"pith:KB5YVM3M","schema_version":"1.0","canonical_sha256":"507b8ab36cd5d5ad93c3c7485e9921dd86450ad82c78e47de2001354bcd6d408","source":{"kind":"arxiv","id":"1510.05284","version":1},"attestation_state":"computed","paper":{"title":"Privacy sets for constrained space-filling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Eva Benkov\\'a, Radoslav Harman, Werner G. M\\\"uller","submitted_at":"2015-10-18T17:25:43Z","abstract_excerpt":"The paper provides typology for space filling into what we call \"soft\" and \"hard\" methods along with introducing the central notion of privacy sets for dealing with the latter. A heuristic algorithm based on this notion is presented and we compare its performance on some well-known examples."},"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":"1510.05284","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-10-18T17:25:43Z","cross_cats_sorted":[],"title_canon_sha256":"acfdca1ec4f32efc6aa2c10531283e459ac1dd092acde4b491db8fab39d162a0","abstract_canon_sha256":"9c8c7b25018e52b9915acec83adbebecb203a4cded2f8fe3440edc43ee2c630d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:52.691806Z","signature_b64":"KfYnxdX+5bTHl2K8XVad73dBMnmF+oqxD7I0/P8wz/hYnSorYkMWAm+o0GkZt1cpsLlBv40iR4BroNGMw8y8DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"507b8ab36cd5d5ad93c3c7485e9921dd86450ad82c78e47de2001354bcd6d408","last_reissued_at":"2026-05-18T01:29:52.691305Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:52.691305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Privacy sets for constrained space-filling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Eva Benkov\\'a, Radoslav Harman, Werner G. M\\\"uller","submitted_at":"2015-10-18T17:25:43Z","abstract_excerpt":"The paper provides typology for space filling into what we call \"soft\" and \"hard\" methods along with introducing the central notion of privacy sets for dealing with the latter. A heuristic algorithm based on this notion is presented and we compare its performance on some well-known examples."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05284","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":"1510.05284","created_at":"2026-05-18T01:29:52.691375+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.05284v1","created_at":"2026-05-18T01:29:52.691375+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05284","created_at":"2026-05-18T01:29:52.691375+00:00"},{"alias_kind":"pith_short_12","alias_value":"KB5YVM3M2XK2","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"KB5YVM3M2XK23E6D","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"KB5YVM3M","created_at":"2026-05-18T12:29:27.538025+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/KB5YVM3M2XK23E6DY5EF5GJB3W","json":"https://pith.science/pith/KB5YVM3M2XK23E6DY5EF5GJB3W.json","graph_json":"https://pith.science/api/pith-number/KB5YVM3M2XK23E6DY5EF5GJB3W/graph.json","events_json":"https://pith.science/api/pith-number/KB5YVM3M2XK23E6DY5EF5GJB3W/events.json","paper":"https://pith.science/paper/KB5YVM3M"},"agent_actions":{"view_html":"https://pith.science/pith/KB5YVM3M2XK23E6DY5EF5GJB3W","download_json":"https://pith.science/pith/KB5YVM3M2XK23E6DY5EF5GJB3W.json","view_paper":"https://pith.science/paper/KB5YVM3M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.05284&json=true","fetch_graph":"https://pith.science/api/pith-number/KB5YVM3M2XK23E6DY5EF5GJB3W/graph.json","fetch_events":"https://pith.science/api/pith-number/KB5YVM3M2XK23E6DY5EF5GJB3W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KB5YVM3M2XK23E6DY5EF5GJB3W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KB5YVM3M2XK23E6DY5EF5GJB3W/action/storage_attestation","attest_author":"https://pith.science/pith/KB5YVM3M2XK23E6DY5EF5GJB3W/action/author_attestation","sign_citation":"https://pith.science/pith/KB5YVM3M2XK23E6DY5EF5GJB3W/action/citation_signature","submit_replication":"https://pith.science/pith/KB5YVM3M2XK23E6DY5EF5GJB3W/action/replication_record"}},"created_at":"2026-05-18T01:29:52.691375+00:00","updated_at":"2026-05-18T01:29:52.691375+00:00"}