{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MOL66RPRD733A725DLSWIDEOHT","short_pith_number":"pith:MOL66RPR","schema_version":"1.0","canonical_sha256":"6397ef45f11ff7b07f5d1ae5640c8e3ce9c4090687aa3728a094609f44cb446f","source":{"kind":"arxiv","id":"1706.06026","version":1},"attestation_state":"computed","paper":{"title":"The $\\mathcal{E}$-Average Common Submatrix: Approximate Searching in a Restricted Neighborhood","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.IR","cs.IT","math.IT"],"primary_cat":"cs.CV","authors_text":"Alessia Amelio, Darko Brodi\\'c","submitted_at":"2017-06-19T15:53:07Z","abstract_excerpt":"This paper introduces a new (dis)similarity measure for 2D arrays, extending the Average Common Submatrix measure. This is accomplished by: (i) considering the frequency of matching patterns, (ii) restricting the pattern matching to a fixed-size neighborhood, and (iii) computing a distance-based approximate matching. This will achieve better performances with low execution time and larger information retrieval."},"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":"1706.06026","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-06-19T15:53:07Z","cross_cats_sorted":["cs.DM","cs.IR","cs.IT","math.IT"],"title_canon_sha256":"07228cc996bce4b97569ed34126aa8da489b1be79841fae621088b198744e525","abstract_canon_sha256":"9b86f002a9d13dbc532f8e46d67441cacb95dd4e5916f40140b6433f4a4f7752"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:08.294310Z","signature_b64":"kAyoAoO7PHORnQXga1/P1OToAI2eT4KrArd3RC3GDszQjLClXUhCI7Sl/JlhPYtiQ/DRgtNjidkLYG1Cd3ZxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6397ef45f11ff7b07f5d1ae5640c8e3ce9c4090687aa3728a094609f44cb446f","last_reissued_at":"2026-05-18T00:42:08.293906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:08.293906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The $\\mathcal{E}$-Average Common Submatrix: Approximate Searching in a Restricted Neighborhood","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.IR","cs.IT","math.IT"],"primary_cat":"cs.CV","authors_text":"Alessia Amelio, Darko Brodi\\'c","submitted_at":"2017-06-19T15:53:07Z","abstract_excerpt":"This paper introduces a new (dis)similarity measure for 2D arrays, extending the Average Common Submatrix measure. This is accomplished by: (i) considering the frequency of matching patterns, (ii) restricting the pattern matching to a fixed-size neighborhood, and (iii) computing a distance-based approximate matching. This will achieve better performances with low execution time and larger information retrieval."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06026","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":"1706.06026","created_at":"2026-05-18T00:42:08.293963+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.06026v1","created_at":"2026-05-18T00:42:08.293963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06026","created_at":"2026-05-18T00:42:08.293963+00:00"},{"alias_kind":"pith_short_12","alias_value":"MOL66RPRD733","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MOL66RPRD733A725","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MOL66RPR","created_at":"2026-05-18T12:31:31.346846+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/MOL66RPRD733A725DLSWIDEOHT","json":"https://pith.science/pith/MOL66RPRD733A725DLSWIDEOHT.json","graph_json":"https://pith.science/api/pith-number/MOL66RPRD733A725DLSWIDEOHT/graph.json","events_json":"https://pith.science/api/pith-number/MOL66RPRD733A725DLSWIDEOHT/events.json","paper":"https://pith.science/paper/MOL66RPR"},"agent_actions":{"view_html":"https://pith.science/pith/MOL66RPRD733A725DLSWIDEOHT","download_json":"https://pith.science/pith/MOL66RPRD733A725DLSWIDEOHT.json","view_paper":"https://pith.science/paper/MOL66RPR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.06026&json=true","fetch_graph":"https://pith.science/api/pith-number/MOL66RPRD733A725DLSWIDEOHT/graph.json","fetch_events":"https://pith.science/api/pith-number/MOL66RPRD733A725DLSWIDEOHT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MOL66RPRD733A725DLSWIDEOHT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MOL66RPRD733A725DLSWIDEOHT/action/storage_attestation","attest_author":"https://pith.science/pith/MOL66RPRD733A725DLSWIDEOHT/action/author_attestation","sign_citation":"https://pith.science/pith/MOL66RPRD733A725DLSWIDEOHT/action/citation_signature","submit_replication":"https://pith.science/pith/MOL66RPRD733A725DLSWIDEOHT/action/replication_record"}},"created_at":"2026-05-18T00:42:08.293963+00:00","updated_at":"2026-05-18T00:42:08.293963+00:00"}