{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZKF377WTQNNMZPD2DJLSJMKV7N","short_pith_number":"pith:ZKF377WT","schema_version":"1.0","canonical_sha256":"ca8bbffed3835accbc7a1a5724b155fb78c095dca449f097013e0e6b23eb4b40","source":{"kind":"arxiv","id":"1809.08858","version":1},"attestation_state":"computed","paper":{"title":"Graph Pattern Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Balagopal Komarath, Karteek Sreenivasaiah, Markus Bl\\\"aser","submitted_at":"2018-09-24T11:53:09Z","abstract_excerpt":"We study the time complexity of induced subgraph isomorphism problems where the pattern graph is fixed. The earliest known example of an improvement over trivial algorithms is by Itai and Rodeh (1978) who sped up triangle detection in graphs using fast matrix multiplication. This algorithm was generalized by Ne\\v{s}et\\v{r}il and Poljak (1985) to speed up detection of k-cliques.\n  Improved algorithms are known for certain small-sized patterns. For example, a linear-time algorithm is known for detecting length-4 paths. In this paper, we give the first pattern detection algorithm that improves up"},"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":"1809.08858","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-09-24T11:53:09Z","cross_cats_sorted":[],"title_canon_sha256":"d169eef6c5f00ab3e48e8479ca3b0ea73118e9463d3f8613507c3ed751ca138f","abstract_canon_sha256":"3f6b22bc50a32bd8ee173a2527f8faaf4eb2ec49cfdfd246f5bef5b0519968a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:03.358552Z","signature_b64":"MiPCfPR1dL6L1jQE3Bpg2BlujLzd+6/7zewb9FalsUwunOHF2aU9c8rTGZ91IiBPcpGzvd33GQB3dzEfDufKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca8bbffed3835accbc7a1a5724b155fb78c095dca449f097013e0e6b23eb4b40","last_reissued_at":"2026-05-18T00:05:03.358088Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:03.358088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Pattern Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Balagopal Komarath, Karteek Sreenivasaiah, Markus Bl\\\"aser","submitted_at":"2018-09-24T11:53:09Z","abstract_excerpt":"We study the time complexity of induced subgraph isomorphism problems where the pattern graph is fixed. The earliest known example of an improvement over trivial algorithms is by Itai and Rodeh (1978) who sped up triangle detection in graphs using fast matrix multiplication. This algorithm was generalized by Ne\\v{s}et\\v{r}il and Poljak (1985) to speed up detection of k-cliques.\n  Improved algorithms are known for certain small-sized patterns. For example, a linear-time algorithm is known for detecting length-4 paths. In this paper, we give the first pattern detection algorithm that improves up"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08858","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":"1809.08858","created_at":"2026-05-18T00:05:03.358167+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.08858v1","created_at":"2026-05-18T00:05:03.358167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08858","created_at":"2026-05-18T00:05:03.358167+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZKF377WTQNNM","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZKF377WTQNNMZPD2","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZKF377WT","created_at":"2026-05-18T12:33:07.085635+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/ZKF377WTQNNMZPD2DJLSJMKV7N","json":"https://pith.science/pith/ZKF377WTQNNMZPD2DJLSJMKV7N.json","graph_json":"https://pith.science/api/pith-number/ZKF377WTQNNMZPD2DJLSJMKV7N/graph.json","events_json":"https://pith.science/api/pith-number/ZKF377WTQNNMZPD2DJLSJMKV7N/events.json","paper":"https://pith.science/paper/ZKF377WT"},"agent_actions":{"view_html":"https://pith.science/pith/ZKF377WTQNNMZPD2DJLSJMKV7N","download_json":"https://pith.science/pith/ZKF377WTQNNMZPD2DJLSJMKV7N.json","view_paper":"https://pith.science/paper/ZKF377WT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.08858&json=true","fetch_graph":"https://pith.science/api/pith-number/ZKF377WTQNNMZPD2DJLSJMKV7N/graph.json","fetch_events":"https://pith.science/api/pith-number/ZKF377WTQNNMZPD2DJLSJMKV7N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZKF377WTQNNMZPD2DJLSJMKV7N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZKF377WTQNNMZPD2DJLSJMKV7N/action/storage_attestation","attest_author":"https://pith.science/pith/ZKF377WTQNNMZPD2DJLSJMKV7N/action/author_attestation","sign_citation":"https://pith.science/pith/ZKF377WTQNNMZPD2DJLSJMKV7N/action/citation_signature","submit_replication":"https://pith.science/pith/ZKF377WTQNNMZPD2DJLSJMKV7N/action/replication_record"}},"created_at":"2026-05-18T00:05:03.358167+00:00","updated_at":"2026-05-18T00:05:03.358167+00:00"}