{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OOPU3REXJVAA4O7DEAYSPMZIEI","short_pith_number":"pith:OOPU3REX","schema_version":"1.0","canonical_sha256":"739f4dc4974d400e3be3203127b3282238da4ed9c3273aac2cb83a1daa82dc05","source":{"kind":"arxiv","id":"1408.2592","version":1},"attestation_state":"computed","paper":{"title":"Increasing-Chord Graphs On Point Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Fabrizio Frati, Hooman Reisi Dehkordi, Joachim Gudmundsson","submitted_at":"2014-08-12T00:36:10Z","abstract_excerpt":"We tackle the problem of constructing increasing-chord graphs spanning point sets. We prove that, for every point set P with n points, there exists an increasing-chord planar graph with O(n) Steiner points spanning P. Further, we prove that, for every convex point set P with n points, there exists an increasing-chord graph with O(n log n) edges (and with no Steiner points) spanning P."},"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":"1408.2592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-08-12T00:36:10Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"32298c4c965e9b471703b2e1ab9e56fb5a5d0b9537542237ae0ffb8d64f3cab3","abstract_canon_sha256":"451570481e678d81910c4aa535a481d1f27a780e889ba385f1b0b0f03f62c0f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:22.720347Z","signature_b64":"Gkxf6KHuftt4aSqZrIdN4tgFR6CBjg3Xd8wC9S2J1nasQ3BKKfizQJ5B10ahuyc/Q8JnS/+DXqHVgIR3+yIQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"739f4dc4974d400e3be3203127b3282238da4ed9c3273aac2cb83a1daa82dc05","last_reissued_at":"2026-05-18T02:45:22.719944Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:22.719944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Increasing-Chord Graphs On Point Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Fabrizio Frati, Hooman Reisi Dehkordi, Joachim Gudmundsson","submitted_at":"2014-08-12T00:36:10Z","abstract_excerpt":"We tackle the problem of constructing increasing-chord graphs spanning point sets. We prove that, for every point set P with n points, there exists an increasing-chord planar graph with O(n) Steiner points spanning P. Further, we prove that, for every convex point set P with n points, there exists an increasing-chord graph with O(n log n) edges (and with no Steiner points) spanning P."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2592","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":"1408.2592","created_at":"2026-05-18T02:45:22.719998+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.2592v1","created_at":"2026-05-18T02:45:22.719998+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2592","created_at":"2026-05-18T02:45:22.719998+00:00"},{"alias_kind":"pith_short_12","alias_value":"OOPU3REXJVAA","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"OOPU3REXJVAA4O7D","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"OOPU3REX","created_at":"2026-05-18T12:28:41.024544+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/OOPU3REXJVAA4O7DEAYSPMZIEI","json":"https://pith.science/pith/OOPU3REXJVAA4O7DEAYSPMZIEI.json","graph_json":"https://pith.science/api/pith-number/OOPU3REXJVAA4O7DEAYSPMZIEI/graph.json","events_json":"https://pith.science/api/pith-number/OOPU3REXJVAA4O7DEAYSPMZIEI/events.json","paper":"https://pith.science/paper/OOPU3REX"},"agent_actions":{"view_html":"https://pith.science/pith/OOPU3REXJVAA4O7DEAYSPMZIEI","download_json":"https://pith.science/pith/OOPU3REXJVAA4O7DEAYSPMZIEI.json","view_paper":"https://pith.science/paper/OOPU3REX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.2592&json=true","fetch_graph":"https://pith.science/api/pith-number/OOPU3REXJVAA4O7DEAYSPMZIEI/graph.json","fetch_events":"https://pith.science/api/pith-number/OOPU3REXJVAA4O7DEAYSPMZIEI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OOPU3REXJVAA4O7DEAYSPMZIEI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OOPU3REXJVAA4O7DEAYSPMZIEI/action/storage_attestation","attest_author":"https://pith.science/pith/OOPU3REXJVAA4O7DEAYSPMZIEI/action/author_attestation","sign_citation":"https://pith.science/pith/OOPU3REXJVAA4O7DEAYSPMZIEI/action/citation_signature","submit_replication":"https://pith.science/pith/OOPU3REXJVAA4O7DEAYSPMZIEI/action/replication_record"}},"created_at":"2026-05-18T02:45:22.719998+00:00","updated_at":"2026-05-18T02:45:22.719998+00:00"}