{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HJP2LWZYD6FRVJSAYGBNXWRXVO","short_pith_number":"pith:HJP2LWZY","schema_version":"1.0","canonical_sha256":"3a5fa5db381f8b1aa640c182dbda37ab938baca3e1941d473435f79a386a6feb","source":{"kind":"arxiv","id":"1209.0756","version":1},"attestation_state":"computed","paper":{"title":"Data-Oblivious Graph Drawing Model and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia","submitted_at":"2012-09-04T19:51:16Z","abstract_excerpt":"We study graph drawing in a cloud-computing context where data is stored externally and processed using a small local working storage. We show that a number of classic graph drawing algorithms can be efficiently implemented in such a framework where the client can maintain privacy while constructing a drawing of her graph."},"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":"1209.0756","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-04T19:51:16Z","cross_cats_sorted":[],"title_canon_sha256":"decc15009c1a3c0bfc5ad1d82fc503d503007e27d49d36bd3c1d5ae9f9f79e0c","abstract_canon_sha256":"0d53d0cea305fb7c2394230abe610fd8a6254e5b96bcde429bfbbeebf5ed0a91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:17.270648Z","signature_b64":"YlzpPPxLDwwAed0xPcnRJlr6+hPwZKiW3AkJNpGL8cnho7lSnynSdO7+yMi7t7DwYZeRDnFJZRkpmLiEIMKbBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a5fa5db381f8b1aa640c182dbda37ab938baca3e1941d473435f79a386a6feb","last_reissued_at":"2026-05-18T03:46:17.269972Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:17.269972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data-Oblivious Graph Drawing Model and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia","submitted_at":"2012-09-04T19:51:16Z","abstract_excerpt":"We study graph drawing in a cloud-computing context where data is stored externally and processed using a small local working storage. We show that a number of classic graph drawing algorithms can be efficiently implemented in such a framework where the client can maintain privacy while constructing a drawing of her graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0756","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":"1209.0756","created_at":"2026-05-18T03:46:17.270100+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.0756v1","created_at":"2026-05-18T03:46:17.270100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0756","created_at":"2026-05-18T03:46:17.270100+00:00"},{"alias_kind":"pith_short_12","alias_value":"HJP2LWZYD6FR","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HJP2LWZYD6FRVJSA","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HJP2LWZY","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/HJP2LWZYD6FRVJSAYGBNXWRXVO","json":"https://pith.science/pith/HJP2LWZYD6FRVJSAYGBNXWRXVO.json","graph_json":"https://pith.science/api/pith-number/HJP2LWZYD6FRVJSAYGBNXWRXVO/graph.json","events_json":"https://pith.science/api/pith-number/HJP2LWZYD6FRVJSAYGBNXWRXVO/events.json","paper":"https://pith.science/paper/HJP2LWZY"},"agent_actions":{"view_html":"https://pith.science/pith/HJP2LWZYD6FRVJSAYGBNXWRXVO","download_json":"https://pith.science/pith/HJP2LWZYD6FRVJSAYGBNXWRXVO.json","view_paper":"https://pith.science/paper/HJP2LWZY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.0756&json=true","fetch_graph":"https://pith.science/api/pith-number/HJP2LWZYD6FRVJSAYGBNXWRXVO/graph.json","fetch_events":"https://pith.science/api/pith-number/HJP2LWZYD6FRVJSAYGBNXWRXVO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HJP2LWZYD6FRVJSAYGBNXWRXVO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HJP2LWZYD6FRVJSAYGBNXWRXVO/action/storage_attestation","attest_author":"https://pith.science/pith/HJP2LWZYD6FRVJSAYGBNXWRXVO/action/author_attestation","sign_citation":"https://pith.science/pith/HJP2LWZYD6FRVJSAYGBNXWRXVO/action/citation_signature","submit_replication":"https://pith.science/pith/HJP2LWZYD6FRVJSAYGBNXWRXVO/action/replication_record"}},"created_at":"2026-05-18T03:46:17.270100+00:00","updated_at":"2026-05-18T03:46:17.270100+00:00"}