{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:VJ5ASHMHIXOTQ6KRGTHGFUGSWE","short_pith_number":"pith:VJ5ASHMH","schema_version":"1.0","canonical_sha256":"aa7a091d8745dd38795134ce62d0d2b110ea062d2ce66de04094191ef3f79837","source":{"kind":"arxiv","id":"0902.3208","version":1},"attestation_state":"computed","paper":{"title":"A Fast Multigrid Algorithm for Energy Minimization Under Planar Density Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"Achi Brandt, Dorit Ron, Ilya Safro","submitted_at":"2009-02-18T17:59:47Z","abstract_excerpt":"The two-dimensional layout optimization problem reinforced by the efficient space utilization demand has a wide spectrum of practical applications. Formulating the problem as a nonlinear minimization problem under planar equality and/or inequality density constraints, we present a linear time multigrid algorithm for solving correction to this problem. The method is demonstrated on various graph drawing (visualization) instances."},"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":"0902.3208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-02-18T17:59:47Z","cross_cats_sorted":["cs.MS","cs.NA","math.NA"],"title_canon_sha256":"5d328f9f1f1eac199642a5bbb092b0ba29789c58e5e3bbf68ad3a40cf5e6a068","abstract_canon_sha256":"3fd4c2397bce392229038e7ebc7a8a89bae03839aec82653a148757f8d396939"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T23:06:11.140572Z","signature_b64":"0KPOfBN1U8AfivR2qTKEStTiM+uoN1sAt9tccWltygfkvxouUh6SSheekJQV7c+wqv7KCsaVz+HM5+Xap/U6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa7a091d8745dd38795134ce62d0d2b110ea062d2ce66de04094191ef3f79837","last_reissued_at":"2026-06-03T23:06:11.140171Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T23:06:11.140171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Multigrid Algorithm for Energy Minimization Under Planar Density Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"Achi Brandt, Dorit Ron, Ilya Safro","submitted_at":"2009-02-18T17:59:47Z","abstract_excerpt":"The two-dimensional layout optimization problem reinforced by the efficient space utilization demand has a wide spectrum of practical applications. Formulating the problem as a nonlinear minimization problem under planar equality and/or inequality density constraints, we present a linear time multigrid algorithm for solving correction to this problem. The method is demonstrated on various graph drawing (visualization) instances."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.3208","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0902.3208/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"0902.3208","created_at":"2026-06-03T23:06:11.140233+00:00"},{"alias_kind":"arxiv_version","alias_value":"0902.3208v1","created_at":"2026-06-03T23:06:11.140233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.3208","created_at":"2026-06-03T23:06:11.140233+00:00"},{"alias_kind":"pith_short_12","alias_value":"VJ5ASHMHIXOT","created_at":"2026-06-03T23:06:11.140233+00:00"},{"alias_kind":"pith_short_16","alias_value":"VJ5ASHMHIXOTQ6KR","created_at":"2026-06-03T23:06:11.140233+00:00"},{"alias_kind":"pith_short_8","alias_value":"VJ5ASHMH","created_at":"2026-06-03T23:06:11.140233+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/VJ5ASHMHIXOTQ6KRGTHGFUGSWE","json":"https://pith.science/pith/VJ5ASHMHIXOTQ6KRGTHGFUGSWE.json","graph_json":"https://pith.science/api/pith-number/VJ5ASHMHIXOTQ6KRGTHGFUGSWE/graph.json","events_json":"https://pith.science/api/pith-number/VJ5ASHMHIXOTQ6KRGTHGFUGSWE/events.json","paper":"https://pith.science/paper/VJ5ASHMH"},"agent_actions":{"view_html":"https://pith.science/pith/VJ5ASHMHIXOTQ6KRGTHGFUGSWE","download_json":"https://pith.science/pith/VJ5ASHMHIXOTQ6KRGTHGFUGSWE.json","view_paper":"https://pith.science/paper/VJ5ASHMH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0902.3208&json=true","fetch_graph":"https://pith.science/api/pith-number/VJ5ASHMHIXOTQ6KRGTHGFUGSWE/graph.json","fetch_events":"https://pith.science/api/pith-number/VJ5ASHMHIXOTQ6KRGTHGFUGSWE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VJ5ASHMHIXOTQ6KRGTHGFUGSWE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VJ5ASHMHIXOTQ6KRGTHGFUGSWE/action/storage_attestation","attest_author":"https://pith.science/pith/VJ5ASHMHIXOTQ6KRGTHGFUGSWE/action/author_attestation","sign_citation":"https://pith.science/pith/VJ5ASHMHIXOTQ6KRGTHGFUGSWE/action/citation_signature","submit_replication":"https://pith.science/pith/VJ5ASHMHIXOTQ6KRGTHGFUGSWE/action/replication_record"}},"created_at":"2026-06-03T23:06:11.140233+00:00","updated_at":"2026-06-03T23:06:11.140233+00:00"}