{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:NDB343FWFDIK6WGEVNVKCDJ7NR","short_pith_number":"pith:NDB343FW","canonical_record":{"source":{"id":"2010.05822","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-10-12T16:16:28Z","cross_cats_sorted":[],"title_canon_sha256":"a5a6522db135cde6f4e77a1f1cf6eaca9d3f6ca62d45d39147b00ec707b6a901","abstract_canon_sha256":"fe08a94627a132ad68f7b6e455b47b828922a857747c62ceb93c64f3c5a4ade0"},"schema_version":"1.0"},"canonical_sha256":"68c3be6cb628d0af58c4ab6aa10d3f6c56236427d0ec16e16132fff1c45892fd","source":{"kind":"arxiv","id":"2010.05822","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.05822","created_at":"2026-07-05T01:42:10Z"},{"alias_kind":"arxiv_version","alias_value":"2010.05822v1","created_at":"2026-07-05T01:42:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.05822","created_at":"2026-07-05T01:42:10Z"},{"alias_kind":"pith_short_12","alias_value":"NDB343FWFDIK","created_at":"2026-07-05T01:42:10Z"},{"alias_kind":"pith_short_16","alias_value":"NDB343FWFDIK6WGE","created_at":"2026-07-05T01:42:10Z"},{"alias_kind":"pith_short_8","alias_value":"NDB343FW","created_at":"2026-07-05T01:42:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:NDB343FWFDIK6WGEVNVKCDJ7NR","target":"record","payload":{"canonical_record":{"source":{"id":"2010.05822","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-10-12T16:16:28Z","cross_cats_sorted":[],"title_canon_sha256":"a5a6522db135cde6f4e77a1f1cf6eaca9d3f6ca62d45d39147b00ec707b6a901","abstract_canon_sha256":"fe08a94627a132ad68f7b6e455b47b828922a857747c62ceb93c64f3c5a4ade0"},"schema_version":"1.0"},"canonical_sha256":"68c3be6cb628d0af58c4ab6aa10d3f6c56236427d0ec16e16132fff1c45892fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:42:10.897080Z","signature_b64":"T2XJ/xbQf5NG9BV7PPOGtMNiQ6/HN0fdLA27vqS8EETI6Dn6Y5fbAMK8jZpj9XGrM2QcdLBXJDTzG/DHIIXuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68c3be6cb628d0af58c4ab6aa10d3f6c56236427d0ec16e16132fff1c45892fd","last_reissued_at":"2026-07-05T01:42:10.896668Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:42:10.896668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.05822","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-07-05T01:42:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7JpTAMdgRkucPxzEhBKZOhxsMh3WNngW3r/+drTZSOwtZQ13T8CV1z6FVNyQSRKblv1AQq4DQ3F5vsF40LoRDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:58:04.911003Z"},"content_sha256":"a9f89204787a028d61f66262037b92d7be685e8f71e5a5c88ce56e3f9c25f97f","schema_version":"1.0","event_id":"sha256:a9f89204787a028d61f66262037b92d7be685e8f71e5a5c88ce56e3f9c25f97f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:NDB343FWFDIK6WGEVNVKCDJ7NR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Nobutaka Shimizu, Shuichi Hirahara","submitted_at":"2020-10-12T16:16:28Z","abstract_excerpt":"In this paper, we seek a natural problem and a natural distribution of instances such that any $O(n^{c-\\epsilon})$-time algorithm fails to solve most instances drawn from the distribution, while the problem admits an $n^{c+o(1)}$-time algorithm that correctly solves all instances. Specifically, we consider the $K_{a,b}$ counting problem in a random bipartite graph, where $K_{a,b}$ is a complete bipartite graph for constants $a$ and $b$. We proved that the $K_{a,b}$ counting problem admits an $n^{a+o(1)}$-time algorithm if $a\\geq 8$, while any $n^{a-\\epsilon}$-time algorithm fails to solve it e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.05822","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.05822/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"},"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-07-05T01:42:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VgD6vYPADVo0NG0KAnG65eVQaKhp+HIX22mWigjrvTThxXhbfWJdszaqa3Ug6wYizpcMmcCgSPgU/B1wcwIFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:58:04.911412Z"},"content_sha256":"6222e176a236a1c9b10af2434e25f96560c4e54d6a0c49f2f94e7bcc9fa8985d","schema_version":"1.0","event_id":"sha256:6222e176a236a1c9b10af2434e25f96560c4e54d6a0c49f2f94e7bcc9fa8985d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NDB343FWFDIK6WGEVNVKCDJ7NR/bundle.json","state_url":"https://pith.science/pith/NDB343FWFDIK6WGEVNVKCDJ7NR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NDB343FWFDIK6WGEVNVKCDJ7NR/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-07-05T15:58:04Z","links":{"resolver":"https://pith.science/pith/NDB343FWFDIK6WGEVNVKCDJ7NR","bundle":"https://pith.science/pith/NDB343FWFDIK6WGEVNVKCDJ7NR/bundle.json","state":"https://pith.science/pith/NDB343FWFDIK6WGEVNVKCDJ7NR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NDB343FWFDIK6WGEVNVKCDJ7NR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:NDB343FWFDIK6WGEVNVKCDJ7NR","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":"fe08a94627a132ad68f7b6e455b47b828922a857747c62ceb93c64f3c5a4ade0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-10-12T16:16:28Z","title_canon_sha256":"a5a6522db135cde6f4e77a1f1cf6eaca9d3f6ca62d45d39147b00ec707b6a901"},"schema_version":"1.0","source":{"id":"2010.05822","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.05822","created_at":"2026-07-05T01:42:10Z"},{"alias_kind":"arxiv_version","alias_value":"2010.05822v1","created_at":"2026-07-05T01:42:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.05822","created_at":"2026-07-05T01:42:10Z"},{"alias_kind":"pith_short_12","alias_value":"NDB343FWFDIK","created_at":"2026-07-05T01:42:10Z"},{"alias_kind":"pith_short_16","alias_value":"NDB343FWFDIK6WGE","created_at":"2026-07-05T01:42:10Z"},{"alias_kind":"pith_short_8","alias_value":"NDB343FW","created_at":"2026-07-05T01:42:10Z"}],"graph_snapshots":[{"event_id":"sha256:6222e176a236a1c9b10af2434e25f96560c4e54d6a0c49f2f94e7bcc9fa8985d","target":"graph","created_at":"2026-07-05T01:42:10Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2010.05822/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we seek a natural problem and a natural distribution of instances such that any $O(n^{c-\\epsilon})$-time algorithm fails to solve most instances drawn from the distribution, while the problem admits an $n^{c+o(1)}$-time algorithm that correctly solves all instances. Specifically, we consider the $K_{a,b}$ counting problem in a random bipartite graph, where $K_{a,b}$ is a complete bipartite graph for constants $a$ and $b$. We proved that the $K_{a,b}$ counting problem admits an $n^{a+o(1)}$-time algorithm if $a\\geq 8$, while any $n^{a-\\epsilon}$-time algorithm fails to solve it e","authors_text":"Nobutaka Shimizu, Shuichi Hirahara","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-10-12T16:16:28Z","title":"Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.05822","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:a9f89204787a028d61f66262037b92d7be685e8f71e5a5c88ce56e3f9c25f97f","target":"record","created_at":"2026-07-05T01:42:10Z","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":"fe08a94627a132ad68f7b6e455b47b828922a857747c62ceb93c64f3c5a4ade0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-10-12T16:16:28Z","title_canon_sha256":"a5a6522db135cde6f4e77a1f1cf6eaca9d3f6ca62d45d39147b00ec707b6a901"},"schema_version":"1.0","source":{"id":"2010.05822","kind":"arxiv","version":1}},"canonical_sha256":"68c3be6cb628d0af58c4ab6aa10d3f6c56236427d0ec16e16132fff1c45892fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68c3be6cb628d0af58c4ab6aa10d3f6c56236427d0ec16e16132fff1c45892fd","first_computed_at":"2026-07-05T01:42:10.896668Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:42:10.896668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T2XJ/xbQf5NG9BV7PPOGtMNiQ6/HN0fdLA27vqS8EETI6Dn6Y5fbAMK8jZpj9XGrM2QcdLBXJDTzG/DHIIXuAw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:42:10.897080Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.05822","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9f89204787a028d61f66262037b92d7be685e8f71e5a5c88ce56e3f9c25f97f","sha256:6222e176a236a1c9b10af2434e25f96560c4e54d6a0c49f2f94e7bcc9fa8985d"],"state_sha256":"ca15e6c9132243b8515939d4faa79e5e3e2b0bf5fa4e59a82b3c195b1532e463"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IcZvUIEXYIPvFECcbdpxeagxUB5GIyjr9wg41OsN8k3BIjxgqwplHJRoidoprpVCWJ/0gV1pNqg5ZJ4gZETtBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T15:58:04.914129Z","bundle_sha256":"ebe403d785fd731267d64d6cf4d5d43816f5793638cfa028406863d0e2cf183e"}}