{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ALXZ5ZLDBZDBR5A5KKROEZTWXX","short_pith_number":"pith:ALXZ5ZLD","canonical_record":{"source":{"id":"1803.03705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-09T21:54:48Z","cross_cats_sorted":[],"title_canon_sha256":"a8b83969ba9e9b9e24660377c2ee2a5039668feba353bb8e3bb37c4128477460","abstract_canon_sha256":"ea90fa6d244517932f28fdc001760432a09cb4e3bf88d2e10fdab2de4d3dcbac"},"schema_version":"1.0"},"canonical_sha256":"02ef9ee5630e4618f41d52a2e26676bdfe251d293af77e5da563e620c10b9315","source":{"kind":"arxiv","id":"1803.03705","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03705","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03705v1","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03705","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"pith_short_12","alias_value":"ALXZ5ZLDBZDB","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ALXZ5ZLDBZDBR5A5","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ALXZ5ZLD","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ALXZ5ZLDBZDBR5A5KKROEZTWXX","target":"record","payload":{"canonical_record":{"source":{"id":"1803.03705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-09T21:54:48Z","cross_cats_sorted":[],"title_canon_sha256":"a8b83969ba9e9b9e24660377c2ee2a5039668feba353bb8e3bb37c4128477460","abstract_canon_sha256":"ea90fa6d244517932f28fdc001760432a09cb4e3bf88d2e10fdab2de4d3dcbac"},"schema_version":"1.0"},"canonical_sha256":"02ef9ee5630e4618f41d52a2e26676bdfe251d293af77e5da563e620c10b9315","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:38.407482Z","signature_b64":"iFLiA8WlR8/PLRySfRtNxgYqrGLFUHbEHG1RfIq5uBxcg+K0YCVyv+yhE+dygDAGeR3Avh9sNNWUn6ANDLpzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02ef9ee5630e4618f41d52a2e26676bdfe251d293af77e5da563e620c10b9315","last_reissued_at":"2026-05-18T00:21:38.406844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:38.406844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.03705","source_version":1,"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:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+28By3mgH+4p/yln+BpUvEY0Axr/L0JjzkBxHejcHMFrburv5mD6shsSExpOYbr34jaFINVK+W4Y3kogOad3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:35:02.651028Z"},"content_sha256":"c36bab3f0940a937219a746859b090ec5ac1478a8f4a965eb591f5296eace09f","schema_version":"1.0","event_id":"sha256:c36bab3f0940a937219a746859b090ec5ac1478a8f4a965eb591f5296eace09f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ALXZ5ZLDBZDBR5A5KKROEZTWXX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Geodesic Obstacle Representation of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Fabrizio Montecchiani, Luis Fernando Schultz Xavier da Silveira, Pat Morin, Paz Carmi, Prosenjit Bose, Saeed Mehrabi, Vida Dujmovic","submitted_at":"2018-03-09T21:54:48Z","abstract_excerpt":"An obstacle representation of a graph is a mapping of the vertices onto points in the plane and a set of connected regions of the plane (called obstacles) such that the straight-line segment connecting the points corresponding to two vertices does not intersect any obstacles if and only if the vertices are adjacent in the graph. The obstacle representation and its plane variant (in which the resulting representation is a plane straight-line embedding of the graph) have been extensively studied with the main objective of minimizing the number of obstacles. Recently, Biedl and Mehrabi (GD 2017) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03705","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"},"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:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EDFzvysymIbEPRdnJRB6BGR1KFzEkByUo+Sx/peezgLeDR1DdHUJ7D6Qs1t7syIb3Ua3msZvsCzKHkXwG3UzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:35:02.651639Z"},"content_sha256":"e3b57734713d69b0f3aeefef739fddd4adbc6a26b990e390f6bed7c2819e1805","schema_version":"1.0","event_id":"sha256:e3b57734713d69b0f3aeefef739fddd4adbc6a26b990e390f6bed7c2819e1805"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ALXZ5ZLDBZDBR5A5KKROEZTWXX/bundle.json","state_url":"https://pith.science/pith/ALXZ5ZLDBZDBR5A5KKROEZTWXX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ALXZ5ZLDBZDBR5A5KKROEZTWXX/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-05-26T13:35:02Z","links":{"resolver":"https://pith.science/pith/ALXZ5ZLDBZDBR5A5KKROEZTWXX","bundle":"https://pith.science/pith/ALXZ5ZLDBZDBR5A5KKROEZTWXX/bundle.json","state":"https://pith.science/pith/ALXZ5ZLDBZDBR5A5KKROEZTWXX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ALXZ5ZLDBZDBR5A5KKROEZTWXX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ALXZ5ZLDBZDBR5A5KKROEZTWXX","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":"ea90fa6d244517932f28fdc001760432a09cb4e3bf88d2e10fdab2de4d3dcbac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-09T21:54:48Z","title_canon_sha256":"a8b83969ba9e9b9e24660377c2ee2a5039668feba353bb8e3bb37c4128477460"},"schema_version":"1.0","source":{"id":"1803.03705","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03705","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03705v1","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03705","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"pith_short_12","alias_value":"ALXZ5ZLDBZDB","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ALXZ5ZLDBZDBR5A5","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ALXZ5ZLD","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:e3b57734713d69b0f3aeefef739fddd4adbc6a26b990e390f6bed7c2819e1805","target":"graph","created_at":"2026-05-18T00:21:38Z","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":"An obstacle representation of a graph is a mapping of the vertices onto points in the plane and a set of connected regions of the plane (called obstacles) such that the straight-line segment connecting the points corresponding to two vertices does not intersect any obstacles if and only if the vertices are adjacent in the graph. The obstacle representation and its plane variant (in which the resulting representation is a plane straight-line embedding of the graph) have been extensively studied with the main objective of minimizing the number of obstacles. Recently, Biedl and Mehrabi (GD 2017) ","authors_text":"Fabrizio Montecchiani, Luis Fernando Schultz Xavier da Silveira, Pat Morin, Paz Carmi, Prosenjit Bose, Saeed Mehrabi, Vida Dujmovic","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-09T21:54:48Z","title":"Geodesic Obstacle Representation of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03705","kind":"arxiv","version":1},"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:c36bab3f0940a937219a746859b090ec5ac1478a8f4a965eb591f5296eace09f","target":"record","created_at":"2026-05-18T00:21:38Z","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":"ea90fa6d244517932f28fdc001760432a09cb4e3bf88d2e10fdab2de4d3dcbac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-09T21:54:48Z","title_canon_sha256":"a8b83969ba9e9b9e24660377c2ee2a5039668feba353bb8e3bb37c4128477460"},"schema_version":"1.0","source":{"id":"1803.03705","kind":"arxiv","version":1}},"canonical_sha256":"02ef9ee5630e4618f41d52a2e26676bdfe251d293af77e5da563e620c10b9315","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02ef9ee5630e4618f41d52a2e26676bdfe251d293af77e5da563e620c10b9315","first_computed_at":"2026-05-18T00:21:38.406844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:38.406844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iFLiA8WlR8/PLRySfRtNxgYqrGLFUHbEHG1RfIq5uBxcg+K0YCVyv+yhE+dygDAGeR3Avh9sNNWUn6ANDLpzCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:38.407482Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.03705","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c36bab3f0940a937219a746859b090ec5ac1478a8f4a965eb591f5296eace09f","sha256:e3b57734713d69b0f3aeefef739fddd4adbc6a26b990e390f6bed7c2819e1805"],"state_sha256":"044a4d3c5ab81d444557bf974729dfeaebb3317b25813ac1b3cc8754533bfcec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o/M90QnOZDW0rBP/BO6NBopmgIyFir7lkxTrGxZcnyGuM+x/j7NfmTB2i4Ol9iPBoLRXM7jtLFG8+/Y/tswcCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:35:02.654017Z","bundle_sha256":"7946a7d494774226d849ce9dd69080bc448416b6b21c62805d4a6e847afefa69"}}