{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZKF377WTQNNMZPD2DJLSJMKV7N","short_pith_number":"pith:ZKF377WT","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"},"canonical_sha256":"ca8bbffed3835accbc7a1a5724b155fb78c095dca449f097013e0e6b23eb4b40","source":{"kind":"arxiv","id":"1809.08858","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08858","created_at":"2026-05-18T00:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08858v1","created_at":"2026-05-18T00:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08858","created_at":"2026-05-18T00:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"ZKF377WTQNNM","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZKF377WTQNNMZPD2","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZKF377WT","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZKF377WTQNNMZPD2DJLSJMKV7N","target":"record","payload":{"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"},"canonical_sha256":"ca8bbffed3835accbc7a1a5724b155fb78c095dca449f097013e0e6b23eb4b40","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"},"source_kind":"arxiv","source_id":"1809.08858","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rxcVAosT3/dezB+ETwh/hyYY0vy0aUaguoz2QCCgg4GkABnE2Gdd6kSSJi87Az8zFO+mHL7I9QKKJ5oLKzO8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T04:21:59.563694Z"},"content_sha256":"535a76a82ea44034d4b02102711a2cc7b887e99fe2db4180d1e8a6b93c24776c","schema_version":"1.0","event_id":"sha256:535a76a82ea44034d4b02102711a2cc7b887e99fe2db4180d1e8a6b93c24776c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZKF377WTQNNMZPD2DJLSJMKV7N","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ezx/ThQ5Pkfe/XJ/vfBRsb2RE8wRgFdFoosA1lzECSzFznPAIH9yhWVeqhNBaAc1TxWddYTc+bzfTPon8C/oAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T04:21:59.564089Z"},"content_sha256":"60b1d0945cbae5d11298435056a3203b161929fbe8701fb0ec1e79963d021846","schema_version":"1.0","event_id":"sha256:60b1d0945cbae5d11298435056a3203b161929fbe8701fb0ec1e79963d021846"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZKF377WTQNNMZPD2DJLSJMKV7N/bundle.json","state_url":"https://pith.science/pith/ZKF377WTQNNMZPD2DJLSJMKV7N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZKF377WTQNNMZPD2DJLSJMKV7N/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T04:21:59Z","links":{"resolver":"https://pith.science/pith/ZKF377WTQNNMZPD2DJLSJMKV7N","bundle":"https://pith.science/pith/ZKF377WTQNNMZPD2DJLSJMKV7N/bundle.json","state":"https://pith.science/pith/ZKF377WTQNNMZPD2DJLSJMKV7N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZKF377WTQNNMZPD2DJLSJMKV7N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZKF377WTQNNMZPD2DJLSJMKV7N","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3f6b22bc50a32bd8ee173a2527f8faaf4eb2ec49cfdfd246f5bef5b0519968a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-09-24T11:53:09Z","title_canon_sha256":"d169eef6c5f00ab3e48e8479ca3b0ea73118e9463d3f8613507c3ed751ca138f"},"schema_version":"1.0","source":{"id":"1809.08858","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08858","created_at":"2026-05-18T00:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08858v1","created_at":"2026-05-18T00:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08858","created_at":"2026-05-18T00:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"ZKF377WTQNNM","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZKF377WTQNNMZPD2","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZKF377WT","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:60b1d0945cbae5d11298435056a3203b161929fbe8701fb0ec1e79963d021846","target":"graph","created_at":"2026-05-18T00:05:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Balagopal Komarath, Karteek Sreenivasaiah, Markus Bl\\\"aser","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-09-24T11:53:09Z","title":"Graph Pattern Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08858","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:535a76a82ea44034d4b02102711a2cc7b887e99fe2db4180d1e8a6b93c24776c","target":"record","created_at":"2026-05-18T00:05:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3f6b22bc50a32bd8ee173a2527f8faaf4eb2ec49cfdfd246f5bef5b0519968a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-09-24T11:53:09Z","title_canon_sha256":"d169eef6c5f00ab3e48e8479ca3b0ea73118e9463d3f8613507c3ed751ca138f"},"schema_version":"1.0","source":{"id":"1809.08858","kind":"arxiv","version":1}},"canonical_sha256":"ca8bbffed3835accbc7a1a5724b155fb78c095dca449f097013e0e6b23eb4b40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca8bbffed3835accbc7a1a5724b155fb78c095dca449f097013e0e6b23eb4b40","first_computed_at":"2026-05-18T00:05:03.358088Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:03.358088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MiPCfPR1dL6L1jQE3Bpg2BlujLzd+6/7zewb9FalsUwunOHF2aU9c8rTGZ91IiBPcpGzvd33GQB3dzEfDufKCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:03.358552Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.08858","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:535a76a82ea44034d4b02102711a2cc7b887e99fe2db4180d1e8a6b93c24776c","sha256:60b1d0945cbae5d11298435056a3203b161929fbe8701fb0ec1e79963d021846"],"state_sha256":"25a90b1e81c468bec6bedbf3c8a68ea9ebbb57e8618cac15252d45099d2bf724"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VBdUQy6Y2iH9qKhbcNQpCwUvbvKdjFZucVfhcRVkWgpn+jTpgK0swRaSQ9wAGMy3jqUaSxEwqZDeXu8sgxiqCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T04:21:59.567041Z","bundle_sha256":"215b674b3f1f5901138a65a8ac1205b7a8944ea79300f1db80e283ca18e90d54"}}