{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:UUD2HO7QG44RXVANFUJA6CUXHU","short_pith_number":"pith:UUD2HO7Q","schema_version":"1.0","canonical_sha256":"a507a3bbf037391bd40d2d120f0a973d2347060bc8befc6d6187e20637d0808b","source":{"kind":"arxiv","id":"math/0611679","version":1},"attestation_state":"computed","paper":{"title":"Longest Common Pattern between two Permutations","license":"","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Dominique Rossin (LIAFA), Mathilde Bouvel (LIAFA)","submitted_at":"2006-11-22T10:47:05Z","abstract_excerpt":"In this paper, we give a polynomial (O(n^8)) algorithm for finding a longest common pattern between two permutations of size n given that one is separable. We also give an algorithm for general permutations whose complexity depends on the length of the longest simple permutation involved in one of our permutations."},"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":"math/0611679","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2006-11-22T10:47:05Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"f53b3c041e3fe8f04fdbeaedd00f5304600a1adfdaace2688d351000ea7d5767","abstract_canon_sha256":"47a86fffb8c053c500d25441d636829c6a95b7a45b2578c4dab45d0f7b5c5708"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:26.676822Z","signature_b64":"nRmBu8D+uUO5V7nxEqzk0H0hjeGSzFmSwqVHAwzJ59hjuL7A0A4UwQu86GNwE+BC+/8bBxHVcxz3BqA85lncAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a507a3bbf037391bd40d2d120f0a973d2347060bc8befc6d6187e20637d0808b","last_reissued_at":"2026-05-18T02:41:26.676362Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:26.676362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Longest Common Pattern between two Permutations","license":"","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Dominique Rossin (LIAFA), Mathilde Bouvel (LIAFA)","submitted_at":"2006-11-22T10:47:05Z","abstract_excerpt":"In this paper, we give a polynomial (O(n^8)) algorithm for finding a longest common pattern between two permutations of size n given that one is separable. We also give an algorithm for general permutations whose complexity depends on the length of the longest simple permutation involved in one of our permutations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0611679","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":"math/0611679","created_at":"2026-05-18T02:41:26.676433+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0611679v1","created_at":"2026-05-18T02:41:26.676433+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0611679","created_at":"2026-05-18T02:41:26.676433+00:00"},{"alias_kind":"pith_short_12","alias_value":"UUD2HO7QG44R","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"UUD2HO7QG44RXVAN","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"UUD2HO7Q","created_at":"2026-05-18T12:25:54.717736+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/UUD2HO7QG44RXVANFUJA6CUXHU","json":"https://pith.science/pith/UUD2HO7QG44RXVANFUJA6CUXHU.json","graph_json":"https://pith.science/api/pith-number/UUD2HO7QG44RXVANFUJA6CUXHU/graph.json","events_json":"https://pith.science/api/pith-number/UUD2HO7QG44RXVANFUJA6CUXHU/events.json","paper":"https://pith.science/paper/UUD2HO7Q"},"agent_actions":{"view_html":"https://pith.science/pith/UUD2HO7QG44RXVANFUJA6CUXHU","download_json":"https://pith.science/pith/UUD2HO7QG44RXVANFUJA6CUXHU.json","view_paper":"https://pith.science/paper/UUD2HO7Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0611679&json=true","fetch_graph":"https://pith.science/api/pith-number/UUD2HO7QG44RXVANFUJA6CUXHU/graph.json","fetch_events":"https://pith.science/api/pith-number/UUD2HO7QG44RXVANFUJA6CUXHU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UUD2HO7QG44RXVANFUJA6CUXHU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UUD2HO7QG44RXVANFUJA6CUXHU/action/storage_attestation","attest_author":"https://pith.science/pith/UUD2HO7QG44RXVANFUJA6CUXHU/action/author_attestation","sign_citation":"https://pith.science/pith/UUD2HO7QG44RXVANFUJA6CUXHU/action/citation_signature","submit_replication":"https://pith.science/pith/UUD2HO7QG44RXVANFUJA6CUXHU/action/replication_record"}},"created_at":"2026-05-18T02:41:26.676433+00:00","updated_at":"2026-05-18T02:41:26.676433+00:00"}