{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:DHWP4GE65DRYCKHLSY6ROKYNTQ","short_pith_number":"pith:DHWP4GE6","schema_version":"1.0","canonical_sha256":"19ecfe189ee8e38128eb963d172b0d9c3dfe3527fe6efeab414f4fb4a9ba60b5","source":{"kind":"arxiv","id":"2010.00348","version":1},"attestation_state":"computed","paper":{"title":"Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bart{\\l}omiej Dudek, Pawe{\\l} Gawrychowski","submitted_at":"2020-10-01T12:25:52Z","abstract_excerpt":"Permutation $\\sigma$ appears in permutation $\\pi$ if there exists a subsequence of $\\pi$ that is order-isomorphic to $\\sigma$. The natural question is to check if $\\sigma$ appears in $\\pi$, and if so count the number of occurrences. We know that for any fixed length~k, we can check if a given pattern of length k appears in a permutation of length n in time linear in n, but being able to count all such occurrences in $f(k)\\cdot n^{o(k/\\log k)}$ time would refute the exponential time hypothesis (ETH). This motivates a systematic study of the complexity of counting occurrences for different patte"},"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":"2010.00348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-01T12:25:52Z","cross_cats_sorted":[],"title_canon_sha256":"c8544d08de9f2a888cc03465e97bc14d6313941e8f283af139c33fd93886765a","abstract_canon_sha256":"11999b364149e6411a244bfb2466fd3fcd456a0082dbb427592b7a0f1705bebc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:39:32.810550Z","signature_b64":"+/c3NuzrONbEkF50lMj4sIwBKtx8CV7STUsVQpCiDlpzIPiBgjpc8y9X2OqK5NvstISMCz4fXycqsDMoAXGqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19ecfe189ee8e38128eb963d172b0d9c3dfe3527fe6efeab414f4fb4a9ba60b5","last_reissued_at":"2026-07-05T01:39:32.810157Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:39:32.810157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bart{\\l}omiej Dudek, Pawe{\\l} Gawrychowski","submitted_at":"2020-10-01T12:25:52Z","abstract_excerpt":"Permutation $\\sigma$ appears in permutation $\\pi$ if there exists a subsequence of $\\pi$ that is order-isomorphic to $\\sigma$. The natural question is to check if $\\sigma$ appears in $\\pi$, and if so count the number of occurrences. We know that for any fixed length~k, we can check if a given pattern of length k appears in a permutation of length n in time linear in n, but being able to count all such occurrences in $f(k)\\cdot n^{o(k/\\log k)}$ time would refute the exponential time hypothesis (ETH). This motivates a systematic study of the complexity of counting occurrences for different patte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.00348","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.00348/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2010.00348","created_at":"2026-07-05T01:39:32.810211+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.00348v1","created_at":"2026-07-05T01:39:32.810211+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.00348","created_at":"2026-07-05T01:39:32.810211+00:00"},{"alias_kind":"pith_short_12","alias_value":"DHWP4GE65DRY","created_at":"2026-07-05T01:39:32.810211+00:00"},{"alias_kind":"pith_short_16","alias_value":"DHWP4GE65DRYCKHL","created_at":"2026-07-05T01:39:32.810211+00:00"},{"alias_kind":"pith_short_8","alias_value":"DHWP4GE6","created_at":"2026-07-05T01:39:32.810211+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.11291","citing_title":"Permutation patterns in streams","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DHWP4GE65DRYCKHLSY6ROKYNTQ","json":"https://pith.science/pith/DHWP4GE65DRYCKHLSY6ROKYNTQ.json","graph_json":"https://pith.science/api/pith-number/DHWP4GE65DRYCKHLSY6ROKYNTQ/graph.json","events_json":"https://pith.science/api/pith-number/DHWP4GE65DRYCKHLSY6ROKYNTQ/events.json","paper":"https://pith.science/paper/DHWP4GE6"},"agent_actions":{"view_html":"https://pith.science/pith/DHWP4GE65DRYCKHLSY6ROKYNTQ","download_json":"https://pith.science/pith/DHWP4GE65DRYCKHLSY6ROKYNTQ.json","view_paper":"https://pith.science/paper/DHWP4GE6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.00348&json=true","fetch_graph":"https://pith.science/api/pith-number/DHWP4GE65DRYCKHLSY6ROKYNTQ/graph.json","fetch_events":"https://pith.science/api/pith-number/DHWP4GE65DRYCKHLSY6ROKYNTQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DHWP4GE65DRYCKHLSY6ROKYNTQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DHWP4GE65DRYCKHLSY6ROKYNTQ/action/storage_attestation","attest_author":"https://pith.science/pith/DHWP4GE65DRYCKHLSY6ROKYNTQ/action/author_attestation","sign_citation":"https://pith.science/pith/DHWP4GE65DRYCKHLSY6ROKYNTQ/action/citation_signature","submit_replication":"https://pith.science/pith/DHWP4GE65DRYCKHLSY6ROKYNTQ/action/replication_record"}},"created_at":"2026-07-05T01:39:32.810211+00:00","updated_at":"2026-07-05T01:39:32.810211+00:00"}