{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Z3EYXYE7ZVECQSZ7F6KYKITDNM","short_pith_number":"pith:Z3EYXYE7","schema_version":"1.0","canonical_sha256":"cec98be09fcd48284b3f2f958522636b283fde51d6426bd5a812231dab62c97f","source":{"kind":"arxiv","id":"1509.04357","version":1},"attestation_state":"computed","paper":{"title":"Fragmentation properties of two-dimensional Proximity Graphs considering random failures and targeted attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"physics.soc-ph","authors_text":"Alexander K. Hartmann, Christoph Norrenbrock, Oliver Melchert","submitted_at":"2015-09-15T00:36:30Z","abstract_excerpt":"The pivotal quality of proximity graphs is connectivity, i.e. all nodes in the graph are connected to one another either directly or via intermediate nodes. These types of graphs are robust, i.e., they are able to function well even if they are subject to limited removal of elementary building blocks, as it may occur for random failures or targeted attacks. Here, we study how the structure of these graphs is affected when nodes get removed successively until an extensive fraction is removed such that the graphs fragment. We study different types of proximity graphs for various node removal str"},"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":"1509.04357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-09-15T00:36:30Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"9ace1a9755ea035a7f582a927934da1d9df0fdfe67d1e6c8e9f66fbf900fb054","abstract_canon_sha256":"c387aec38b27b240e69736b4693ff0f2cb9c8687d41e1c0c504626b89a68cfab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:03.773476Z","signature_b64":"I1L4YfV9ukqsMA+rKb7Y4qR5jL9sUsrzdpthwu+NyCWJQfwfRuc7o+YINs4qZVxYrFS4V3aSXkxz5jLXmMyUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cec98be09fcd48284b3f2f958522636b283fde51d6426bd5a812231dab62c97f","last_reissued_at":"2026-05-18T00:54:03.773101Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:03.773101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fragmentation properties of two-dimensional Proximity Graphs considering random failures and targeted attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"physics.soc-ph","authors_text":"Alexander K. Hartmann, Christoph Norrenbrock, Oliver Melchert","submitted_at":"2015-09-15T00:36:30Z","abstract_excerpt":"The pivotal quality of proximity graphs is connectivity, i.e. all nodes in the graph are connected to one another either directly or via intermediate nodes. These types of graphs are robust, i.e., they are able to function well even if they are subject to limited removal of elementary building blocks, as it may occur for random failures or targeted attacks. Here, we study how the structure of these graphs is affected when nodes get removed successively until an extensive fraction is removed such that the graphs fragment. We study different types of proximity graphs for various node removal str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04357","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":"1509.04357","created_at":"2026-05-18T00:54:03.773157+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.04357v1","created_at":"2026-05-18T00:54:03.773157+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04357","created_at":"2026-05-18T00:54:03.773157+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3EYXYE7ZVEC","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3EYXYE7ZVECQSZ7","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3EYXYE7","created_at":"2026-05-18T12:29:52.810259+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/Z3EYXYE7ZVECQSZ7F6KYKITDNM","json":"https://pith.science/pith/Z3EYXYE7ZVECQSZ7F6KYKITDNM.json","graph_json":"https://pith.science/api/pith-number/Z3EYXYE7ZVECQSZ7F6KYKITDNM/graph.json","events_json":"https://pith.science/api/pith-number/Z3EYXYE7ZVECQSZ7F6KYKITDNM/events.json","paper":"https://pith.science/paper/Z3EYXYE7"},"agent_actions":{"view_html":"https://pith.science/pith/Z3EYXYE7ZVECQSZ7F6KYKITDNM","download_json":"https://pith.science/pith/Z3EYXYE7ZVECQSZ7F6KYKITDNM.json","view_paper":"https://pith.science/paper/Z3EYXYE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.04357&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3EYXYE7ZVECQSZ7F6KYKITDNM/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3EYXYE7ZVECQSZ7F6KYKITDNM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3EYXYE7ZVECQSZ7F6KYKITDNM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3EYXYE7ZVECQSZ7F6KYKITDNM/action/storage_attestation","attest_author":"https://pith.science/pith/Z3EYXYE7ZVECQSZ7F6KYKITDNM/action/author_attestation","sign_citation":"https://pith.science/pith/Z3EYXYE7ZVECQSZ7F6KYKITDNM/action/citation_signature","submit_replication":"https://pith.science/pith/Z3EYXYE7ZVECQSZ7F6KYKITDNM/action/replication_record"}},"created_at":"2026-05-18T00:54:03.773157+00:00","updated_at":"2026-05-18T00:54:03.773157+00:00"}