{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WLR7AJKWV74APGEUQNEZBJCA42","short_pith_number":"pith:WLR7AJKW","schema_version":"1.0","canonical_sha256":"b2e3f02556aff8079894834990a440e6b7089ff25d06a6d9cb674e98596f955f","source":{"kind":"arxiv","id":"1603.06652","version":3},"attestation_state":"computed","paper":{"title":"Tangles and the Mona Lisa","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Geoff Whittle, Reinhard Diestel","submitted_at":"2016-03-22T01:05:37Z","abstract_excerpt":"We show how an image can, in principle, be described by the tangles of the graph of its pixels.\n  The tangle-tree theorem provides a nested set of separations that efficiently distinguish all the distinguishable tangles in a graph. This translates to a small data set from which the image can be reconstructed.\n  The tangle duality theorem says that a graph either has a certain-order tangle or a tree-structure witnessing that this cannot exist. This tells us the maximum resolution at which the image contains meaningful information."},"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":"1603.06652","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-22T01:05:37Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"76e5d05b9096e407beb174d4dbca68de27744d7fc1a30a9f45436f393018bd9d","abstract_canon_sha256":"a0ab4ff2fdc301f28f0baa156441c68b884ff794fbdfa9ad236404bb6fe6d9a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:05.537244Z","signature_b64":"xIGGl6kknpTaXd1pJrPF7gJEGK+6Vi4eNqKH6bBOYkdldL6pvFskpGGPMFwJrNj78txF73f6UxXEIPgTDqG8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2e3f02556aff8079894834990a440e6b7089ff25d06a6d9cb674e98596f955f","last_reissued_at":"2026-05-18T00:31:05.536589Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:05.536589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tangles and the Mona Lisa","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Geoff Whittle, Reinhard Diestel","submitted_at":"2016-03-22T01:05:37Z","abstract_excerpt":"We show how an image can, in principle, be described by the tangles of the graph of its pixels.\n  The tangle-tree theorem provides a nested set of separations that efficiently distinguish all the distinguishable tangles in a graph. This translates to a small data set from which the image can be reconstructed.\n  The tangle duality theorem says that a graph either has a certain-order tangle or a tree-structure witnessing that this cannot exist. This tells us the maximum resolution at which the image contains meaningful information."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06652","kind":"arxiv","version":3},"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":"1603.06652","created_at":"2026-05-18T00:31:05.536706+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.06652v3","created_at":"2026-05-18T00:31:05.536706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06652","created_at":"2026-05-18T00:31:05.536706+00:00"},{"alias_kind":"pith_short_12","alias_value":"WLR7AJKWV74A","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"WLR7AJKWV74APGEU","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"WLR7AJKW","created_at":"2026-05-18T12:30:48.956258+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/WLR7AJKWV74APGEUQNEZBJCA42","json":"https://pith.science/pith/WLR7AJKWV74APGEUQNEZBJCA42.json","graph_json":"https://pith.science/api/pith-number/WLR7AJKWV74APGEUQNEZBJCA42/graph.json","events_json":"https://pith.science/api/pith-number/WLR7AJKWV74APGEUQNEZBJCA42/events.json","paper":"https://pith.science/paper/WLR7AJKW"},"agent_actions":{"view_html":"https://pith.science/pith/WLR7AJKWV74APGEUQNEZBJCA42","download_json":"https://pith.science/pith/WLR7AJKWV74APGEUQNEZBJCA42.json","view_paper":"https://pith.science/paper/WLR7AJKW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.06652&json=true","fetch_graph":"https://pith.science/api/pith-number/WLR7AJKWV74APGEUQNEZBJCA42/graph.json","fetch_events":"https://pith.science/api/pith-number/WLR7AJKWV74APGEUQNEZBJCA42/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WLR7AJKWV74APGEUQNEZBJCA42/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WLR7AJKWV74APGEUQNEZBJCA42/action/storage_attestation","attest_author":"https://pith.science/pith/WLR7AJKWV74APGEUQNEZBJCA42/action/author_attestation","sign_citation":"https://pith.science/pith/WLR7AJKWV74APGEUQNEZBJCA42/action/citation_signature","submit_replication":"https://pith.science/pith/WLR7AJKWV74APGEUQNEZBJCA42/action/replication_record"}},"created_at":"2026-05-18T00:31:05.536706+00:00","updated_at":"2026-05-18T00:31:05.536706+00:00"}