{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RI5HDH3KJQWMUYCWVO6XDUU6QU","short_pith_number":"pith:RI5HDH3K","schema_version":"1.0","canonical_sha256":"8a3a719f6a4c2cca6056abbd71d29e853b9eaa2afdc200c358c5752f292399d5","source":{"kind":"arxiv","id":"1311.4252","version":1},"attestation_state":"computed","paper":{"title":"Contour polygonal approximation using shortest path in networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"physics.comp-ph","authors_text":"Andr\\'e Ricardo Backes, Dalcimar Casanova, Odemir Martinez Bruno","submitted_at":"2013-11-18T03:16:55Z","abstract_excerpt":"Contour polygonal approximation is a simplified representation of a contour by line segments, so that the main characteristics of the contour remain in a small number of line segments. This paper presents a novel method for polygonal approximation based on the Complex Networks theory. We convert each point of the contour into a vertex, so that we model a regular network. Then we transform this network into a Small-World Complex Network by applying some transformations over its edges. By analyzing of network properties, especially the geodesic path, we compute the polygonal approximation. The 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":"1311.4252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2013-11-18T03:16:55Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"529ae4c5e23213afbb80fe3695d1531bea60e86dbb032a9be39d678f07f7b79f","abstract_canon_sha256":"36c1d7ca225fced47b2fa39dacccf12269d53898aa9611e175a7618c695f3274"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:53.202210Z","signature_b64":"DaFQPMIu21FfarURBEKdP7ta0ypLqkj5xkNRPKg6HHrdbax4bufZZFKvuGXNfVEx81JA7/m42H6aCNuKGyPqAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a3a719f6a4c2cca6056abbd71d29e853b9eaa2afdc200c358c5752f292399d5","last_reissued_at":"2026-05-18T03:06:53.201543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:53.201543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Contour polygonal approximation using shortest path in networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"physics.comp-ph","authors_text":"Andr\\'e Ricardo Backes, Dalcimar Casanova, Odemir Martinez Bruno","submitted_at":"2013-11-18T03:16:55Z","abstract_excerpt":"Contour polygonal approximation is a simplified representation of a contour by line segments, so that the main characteristics of the contour remain in a small number of line segments. This paper presents a novel method for polygonal approximation based on the Complex Networks theory. We convert each point of the contour into a vertex, so that we model a regular network. Then we transform this network into a Small-World Complex Network by applying some transformations over its edges. By analyzing of network properties, especially the geodesic path, we compute the polygonal approximation. The p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4252","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":"1311.4252","created_at":"2026-05-18T03:06:53.201660+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.4252v1","created_at":"2026-05-18T03:06:53.201660+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4252","created_at":"2026-05-18T03:06:53.201660+00:00"},{"alias_kind":"pith_short_12","alias_value":"RI5HDH3KJQWM","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"RI5HDH3KJQWMUYCW","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"RI5HDH3K","created_at":"2026-05-18T12:27:57.521954+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/RI5HDH3KJQWMUYCWVO6XDUU6QU","json":"https://pith.science/pith/RI5HDH3KJQWMUYCWVO6XDUU6QU.json","graph_json":"https://pith.science/api/pith-number/RI5HDH3KJQWMUYCWVO6XDUU6QU/graph.json","events_json":"https://pith.science/api/pith-number/RI5HDH3KJQWMUYCWVO6XDUU6QU/events.json","paper":"https://pith.science/paper/RI5HDH3K"},"agent_actions":{"view_html":"https://pith.science/pith/RI5HDH3KJQWMUYCWVO6XDUU6QU","download_json":"https://pith.science/pith/RI5HDH3KJQWMUYCWVO6XDUU6QU.json","view_paper":"https://pith.science/paper/RI5HDH3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.4252&json=true","fetch_graph":"https://pith.science/api/pith-number/RI5HDH3KJQWMUYCWVO6XDUU6QU/graph.json","fetch_events":"https://pith.science/api/pith-number/RI5HDH3KJQWMUYCWVO6XDUU6QU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RI5HDH3KJQWMUYCWVO6XDUU6QU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RI5HDH3KJQWMUYCWVO6XDUU6QU/action/storage_attestation","attest_author":"https://pith.science/pith/RI5HDH3KJQWMUYCWVO6XDUU6QU/action/author_attestation","sign_citation":"https://pith.science/pith/RI5HDH3KJQWMUYCWVO6XDUU6QU/action/citation_signature","submit_replication":"https://pith.science/pith/RI5HDH3KJQWMUYCWVO6XDUU6QU/action/replication_record"}},"created_at":"2026-05-18T03:06:53.201660+00:00","updated_at":"2026-05-18T03:06:53.201660+00:00"}