{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VON3EOB7KEL6VYXH4LNKRFL7A6","short_pith_number":"pith:VON3EOB7","canonical_record":{"source":{"id":"1306.4111","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-18T09:10:41Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b4977266f20ccaf2124953296b99674e63e8bfd14e6bf5546cca0835b964d606","abstract_canon_sha256":"61448e353b5e3ac3652f7527600c90daaf487098f1adda006bacfcbd166f41be"},"schema_version":"1.0"},"canonical_sha256":"ab9bb2383f5117eae2e7e2daa8957f07ba1c688bcd8768c60e8a7447253e21c4","source":{"kind":"arxiv","id":"1306.4111","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.4111","created_at":"2026-05-18T01:35:20Z"},{"alias_kind":"arxiv_version","alias_value":"1306.4111v2","created_at":"2026-05-18T01:35:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4111","created_at":"2026-05-18T01:35:20Z"},{"alias_kind":"pith_short_12","alias_value":"VON3EOB7KEL6","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VON3EOB7KEL6VYXH","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VON3EOB7","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VON3EOB7KEL6VYXH4LNKRFL7A6","target":"record","payload":{"canonical_record":{"source":{"id":"1306.4111","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-18T09:10:41Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b4977266f20ccaf2124953296b99674e63e8bfd14e6bf5546cca0835b964d606","abstract_canon_sha256":"61448e353b5e3ac3652f7527600c90daaf487098f1adda006bacfcbd166f41be"},"schema_version":"1.0"},"canonical_sha256":"ab9bb2383f5117eae2e7e2daa8957f07ba1c688bcd8768c60e8a7447253e21c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:20.917112Z","signature_b64":"bCzDhtSEjHoeiXSXmu5mZOGtQ/qeiXqpDFAkRLuOVkZD/cr+PBXPgTMVCypOlLH0+qNO4fDNer6OGvNVc6egCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab9bb2383f5117eae2e7e2daa8957f07ba1c688bcd8768c60e8a7447253e21c4","last_reissued_at":"2026-05-18T01:35:20.916311Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:20.916311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.4111","source_version":2,"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-18T01:35:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7L89HrbuXiN6oZSMDjB87DIQuKVkuRUuLGq6qE+kkjGNZRLgVxLsb8OKru/kBv9fN6mjTGPrRcqoqIOXL4RiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:43:23.966005Z"},"content_sha256":"bda9b37688f0c43339c82ddde05041e349791ac3933ee4061bf4ffd5834a4c17","schema_version":"1.0","event_id":"sha256:bda9b37688f0c43339c82ddde05041e349791ac3933ee4061bf4ffd5834a4c17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VON3EOB7KEL6VYXH4LNKRFL7A6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting thin subgraphs via packings faster than meet-in-the-middle time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Andreas Bj\\\"orklund, {\\L}ukasz Kowalik, Petteri Kaski","submitted_at":"2013-06-18T09:10:41Z","abstract_excerpt":"Vassilevska and Williams (STOC 2009) showed how to count simple paths on $k$ vertices and matchings on $k/2$ edges in an $n$-vertex graph in time $n^{k/2+O(1)}$. In the same year, two different algorithms with the same runtime were given by Koutis and Williams~(ICALP 2009), and Bj\\\"orklund \\emph{et al.} (ESA 2009), via $n^{st/2+O(1)}$-time algorithms for counting $t$-tuples of pairwise disjoint sets drawn from a given family of $s$-sized subsets of an $n$-element universe. Shortly afterwards, Alon and Gutner (TALG 2010) showed that these problems have $\\Omega(n^{\\lfloor st/2\\rfloor})$ and $\\Om"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4111","kind":"arxiv","version":2},"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-18T01:35:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Lc8yCnFHqV5/ZcuLW/60NUvJsvu380HBEsEKvV94qid1uA1oyvKEM8oSb4vg/BFL7WgtEsLmRppsFdrnk9vDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:43:23.966356Z"},"content_sha256":"a3250e500a99887831787409c19259a05052610836d6db974653c8f65b938992","schema_version":"1.0","event_id":"sha256:a3250e500a99887831787409c19259a05052610836d6db974653c8f65b938992"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VON3EOB7KEL6VYXH4LNKRFL7A6/bundle.json","state_url":"https://pith.science/pith/VON3EOB7KEL6VYXH4LNKRFL7A6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VON3EOB7KEL6VYXH4LNKRFL7A6/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-09T12:43:23Z","links":{"resolver":"https://pith.science/pith/VON3EOB7KEL6VYXH4LNKRFL7A6","bundle":"https://pith.science/pith/VON3EOB7KEL6VYXH4LNKRFL7A6/bundle.json","state":"https://pith.science/pith/VON3EOB7KEL6VYXH4LNKRFL7A6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VON3EOB7KEL6VYXH4LNKRFL7A6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VON3EOB7KEL6VYXH4LNKRFL7A6","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":"61448e353b5e3ac3652f7527600c90daaf487098f1adda006bacfcbd166f41be","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-18T09:10:41Z","title_canon_sha256":"b4977266f20ccaf2124953296b99674e63e8bfd14e6bf5546cca0835b964d606"},"schema_version":"1.0","source":{"id":"1306.4111","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.4111","created_at":"2026-05-18T01:35:20Z"},{"alias_kind":"arxiv_version","alias_value":"1306.4111v2","created_at":"2026-05-18T01:35:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4111","created_at":"2026-05-18T01:35:20Z"},{"alias_kind":"pith_short_12","alias_value":"VON3EOB7KEL6","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VON3EOB7KEL6VYXH","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VON3EOB7","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:a3250e500a99887831787409c19259a05052610836d6db974653c8f65b938992","target":"graph","created_at":"2026-05-18T01:35:20Z","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":"Vassilevska and Williams (STOC 2009) showed how to count simple paths on $k$ vertices and matchings on $k/2$ edges in an $n$-vertex graph in time $n^{k/2+O(1)}$. In the same year, two different algorithms with the same runtime were given by Koutis and Williams~(ICALP 2009), and Bj\\\"orklund \\emph{et al.} (ESA 2009), via $n^{st/2+O(1)}$-time algorithms for counting $t$-tuples of pairwise disjoint sets drawn from a given family of $s$-sized subsets of an $n$-element universe. Shortly afterwards, Alon and Gutner (TALG 2010) showed that these problems have $\\Omega(n^{\\lfloor st/2\\rfloor})$ and $\\Om","authors_text":"Andreas Bj\\\"orklund, {\\L}ukasz Kowalik, Petteri Kaski","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-18T09:10:41Z","title":"Counting thin subgraphs via packings faster than meet-in-the-middle time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4111","kind":"arxiv","version":2},"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:bda9b37688f0c43339c82ddde05041e349791ac3933ee4061bf4ffd5834a4c17","target":"record","created_at":"2026-05-18T01:35:20Z","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":"61448e353b5e3ac3652f7527600c90daaf487098f1adda006bacfcbd166f41be","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-18T09:10:41Z","title_canon_sha256":"b4977266f20ccaf2124953296b99674e63e8bfd14e6bf5546cca0835b964d606"},"schema_version":"1.0","source":{"id":"1306.4111","kind":"arxiv","version":2}},"canonical_sha256":"ab9bb2383f5117eae2e7e2daa8957f07ba1c688bcd8768c60e8a7447253e21c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab9bb2383f5117eae2e7e2daa8957f07ba1c688bcd8768c60e8a7447253e21c4","first_computed_at":"2026-05-18T01:35:20.916311Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:20.916311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bCzDhtSEjHoeiXSXmu5mZOGtQ/qeiXqpDFAkRLuOVkZD/cr+PBXPgTMVCypOlLH0+qNO4fDNer6OGvNVc6egCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:20.917112Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.4111","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bda9b37688f0c43339c82ddde05041e349791ac3933ee4061bf4ffd5834a4c17","sha256:a3250e500a99887831787409c19259a05052610836d6db974653c8f65b938992"],"state_sha256":"2c29231aba89776a5ce45efbb409061f09cdef24bea2b4a8cf1e8ca8b48423d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jATkI8PYiwQsez3zssBkeiDd8XM4hiid5EDEtHWVSz7lOLF101uTLKFNbH7D+6pd1xEyolmeR8yKXLRVEGQ4AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T12:43:23.968170Z","bundle_sha256":"e6f6f42c1da391b7ddbcd2d73b86f1e5aa7d30842f088442354a2c0681ee7346"}}