{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VHR3C2KXVQFHPIVBD4RPUQ6C53","short_pith_number":"pith:VHR3C2KX","canonical_record":{"source":{"id":"1209.1082","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-05T19:45:18Z","cross_cats_sorted":[],"title_canon_sha256":"b27fa098e9b8ace0e968bcba1a19868dde104570bf87d04cd9848f48f397afc7","abstract_canon_sha256":"9eabe98b0bf85a70b08585a4389bd39a99427195da857b2e73b097d35f717d96"},"schema_version":"1.0"},"canonical_sha256":"a9e3b16957ac0a77a2a11f22fa43c2eef5a26308b335d0be52cfad3bdcac5d92","source":{"kind":"arxiv","id":"1209.1082","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.1082","created_at":"2026-05-18T03:25:46Z"},{"alias_kind":"arxiv_version","alias_value":"1209.1082v3","created_at":"2026-05-18T03:25:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1082","created_at":"2026-05-18T03:25:46Z"},{"alias_kind":"pith_short_12","alias_value":"VHR3C2KXVQFH","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VHR3C2KXVQFHPIVB","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VHR3C2KX","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VHR3C2KXVQFHPIVBD4RPUQ6C53","target":"record","payload":{"canonical_record":{"source":{"id":"1209.1082","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-05T19:45:18Z","cross_cats_sorted":[],"title_canon_sha256":"b27fa098e9b8ace0e968bcba1a19868dde104570bf87d04cd9848f48f397afc7","abstract_canon_sha256":"9eabe98b0bf85a70b08585a4389bd39a99427195da857b2e73b097d35f717d96"},"schema_version":"1.0"},"canonical_sha256":"a9e3b16957ac0a77a2a11f22fa43c2eef5a26308b335d0be52cfad3bdcac5d92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:46.455798Z","signature_b64":"sRYs2SEG0S/3Wq1tosqN+7srz8zLWxZ0qKfLmnjPylgltHk0q6raJt84NvAdjvju7Czu7S+l3J4n81jSvkYUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9e3b16957ac0a77a2a11f22fa43c2eef5a26308b335d0be52cfad3bdcac5d92","last_reissued_at":"2026-05-18T03:25:46.454965Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:46.454965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.1082","source_version":3,"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-18T03:25:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xi+uV5hvCnm1g+foH23HdcopcynZxxxmqu4FX6AXktlTThdIrlOL+ZgPsXDPXJhUAGPMLGGpCGSX9CMPRzpPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:00:08.451745Z"},"content_sha256":"ebac186d158d55e36ac75b367d7a95e785a4d593a8674881bf9f65a1f30fc519","schema_version":"1.0","event_id":"sha256:ebac186d158d55e36ac75b367d7a95e785a4d593a8674881bf9f65a1f30fc519"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VHR3C2KXVQFHPIVBD4RPUQ6C53","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constrained Multilinear Detection and Generalized Graph Motifs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Bjorklund, Lukasz Kowalik, Petteri Kaski","submitted_at":"2012-09-05T19:45:18Z","abstract_excerpt":"We introduce a new algebraic sieving technique to detect constrained multilinear monomials in multivariate polynomial generating functions given by an evaluation oracle. As applications of the technique, we show an $O^*(2^k)$-time polynomial space algorithm for the $k$-sized Graph Motif problem. We also introduce a new optimization variant of the problem, called Closest Graph Motif and solve it within the same time bound. The Closest Graph Motif problem encompasses several previously studied optimization variants, like Maximum Graph Motif, Min-Substitute Graph Motif, and Min-Add Graph Motif. F"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1082","kind":"arxiv","version":3},"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-18T03:25:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NqFH28YLfwMQt5XP6Z53PFkoCwHkvQfMyI4pN3F1qnSovaqRnD0BY6r1LmTGJZWvzEuSPBESNerz+DsF6e5ODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:00:08.452470Z"},"content_sha256":"2c37fa186ff4fa6f861f3a283ec011097fd3a3aec7be291c4486c7de5aab72e2","schema_version":"1.0","event_id":"sha256:2c37fa186ff4fa6f861f3a283ec011097fd3a3aec7be291c4486c7de5aab72e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VHR3C2KXVQFHPIVBD4RPUQ6C53/bundle.json","state_url":"https://pith.science/pith/VHR3C2KXVQFHPIVBD4RPUQ6C53/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VHR3C2KXVQFHPIVBD4RPUQ6C53/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-05-27T15:00:08Z","links":{"resolver":"https://pith.science/pith/VHR3C2KXVQFHPIVBD4RPUQ6C53","bundle":"https://pith.science/pith/VHR3C2KXVQFHPIVBD4RPUQ6C53/bundle.json","state":"https://pith.science/pith/VHR3C2KXVQFHPIVBD4RPUQ6C53/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VHR3C2KXVQFHPIVBD4RPUQ6C53/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VHR3C2KXVQFHPIVBD4RPUQ6C53","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":"9eabe98b0bf85a70b08585a4389bd39a99427195da857b2e73b097d35f717d96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-05T19:45:18Z","title_canon_sha256":"b27fa098e9b8ace0e968bcba1a19868dde104570bf87d04cd9848f48f397afc7"},"schema_version":"1.0","source":{"id":"1209.1082","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.1082","created_at":"2026-05-18T03:25:46Z"},{"alias_kind":"arxiv_version","alias_value":"1209.1082v3","created_at":"2026-05-18T03:25:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1082","created_at":"2026-05-18T03:25:46Z"},{"alias_kind":"pith_short_12","alias_value":"VHR3C2KXVQFH","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VHR3C2KXVQFHPIVB","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VHR3C2KX","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:2c37fa186ff4fa6f861f3a283ec011097fd3a3aec7be291c4486c7de5aab72e2","target":"graph","created_at":"2026-05-18T03:25:46Z","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 introduce a new algebraic sieving technique to detect constrained multilinear monomials in multivariate polynomial generating functions given by an evaluation oracle. As applications of the technique, we show an $O^*(2^k)$-time polynomial space algorithm for the $k$-sized Graph Motif problem. We also introduce a new optimization variant of the problem, called Closest Graph Motif and solve it within the same time bound. The Closest Graph Motif problem encompasses several previously studied optimization variants, like Maximum Graph Motif, Min-Substitute Graph Motif, and Min-Add Graph Motif. F","authors_text":"Andreas Bjorklund, Lukasz Kowalik, Petteri Kaski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-05T19:45:18Z","title":"Constrained Multilinear Detection and Generalized Graph Motifs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1082","kind":"arxiv","version":3},"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:ebac186d158d55e36ac75b367d7a95e785a4d593a8674881bf9f65a1f30fc519","target":"record","created_at":"2026-05-18T03:25:46Z","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":"9eabe98b0bf85a70b08585a4389bd39a99427195da857b2e73b097d35f717d96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-05T19:45:18Z","title_canon_sha256":"b27fa098e9b8ace0e968bcba1a19868dde104570bf87d04cd9848f48f397afc7"},"schema_version":"1.0","source":{"id":"1209.1082","kind":"arxiv","version":3}},"canonical_sha256":"a9e3b16957ac0a77a2a11f22fa43c2eef5a26308b335d0be52cfad3bdcac5d92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9e3b16957ac0a77a2a11f22fa43c2eef5a26308b335d0be52cfad3bdcac5d92","first_computed_at":"2026-05-18T03:25:46.454965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:46.454965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sRYs2SEG0S/3Wq1tosqN+7srz8zLWxZ0qKfLmnjPylgltHk0q6raJt84NvAdjvju7Czu7S+l3J4n81jSvkYUBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:46.455798Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.1082","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ebac186d158d55e36ac75b367d7a95e785a4d593a8674881bf9f65a1f30fc519","sha256:2c37fa186ff4fa6f861f3a283ec011097fd3a3aec7be291c4486c7de5aab72e2"],"state_sha256":"2e12b76dbfd33404a99f9b08100e03b993b94abe06327007264c049415d631ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x2MGeibGkomZaj2JofOQ40QgLWHkM+44KW14Yx2bILRSpIG5Z0FFPTazsHquDY+YU26m/LnEvaGBKxjkGU9LCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:00:08.456619Z","bundle_sha256":"628319c98e0ac2d240f4d25117937518c80a32a86e71e9bf8da270fd335453b6"}}