{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5UTYDNYPB5COG6G5P5VH3EEYIO","short_pith_number":"pith:5UTYDNYP","canonical_record":{"source":{"id":"1302.3763","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-15T14:41:00Z","cross_cats_sorted":[],"title_canon_sha256":"9e86a28840680937ddd9e720a723bb666c46dff27eda66a1fa6d60adda6198ab","abstract_canon_sha256":"c3cdb13e809b634043b45b1e34bc307066654f4929e52a8c2d11d43333f79053"},"schema_version":"1.0"},"canonical_sha256":"ed2781b70f0f44e378dd7f6a7d909843b38b3ba409d4771bd8fd34506b32ebb4","source":{"kind":"arxiv","id":"1302.3763","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3763","created_at":"2026-05-18T03:33:35Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3763v1","created_at":"2026-05-18T03:33:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3763","created_at":"2026-05-18T03:33:35Z"},{"alias_kind":"pith_short_12","alias_value":"5UTYDNYPB5CO","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5UTYDNYPB5COG6G5","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5UTYDNYP","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5UTYDNYPB5COG6G5P5VH3EEYIO","target":"record","payload":{"canonical_record":{"source":{"id":"1302.3763","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-15T14:41:00Z","cross_cats_sorted":[],"title_canon_sha256":"9e86a28840680937ddd9e720a723bb666c46dff27eda66a1fa6d60adda6198ab","abstract_canon_sha256":"c3cdb13e809b634043b45b1e34bc307066654f4929e52a8c2d11d43333f79053"},"schema_version":"1.0"},"canonical_sha256":"ed2781b70f0f44e378dd7f6a7d909843b38b3ba409d4771bd8fd34506b32ebb4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:35.821088Z","signature_b64":"jrHCB4I5HK6b9i28amsZxE0B8mQG+i1wg+qavoNG93ZiK9xFM7QZZ2gOlnYLe+wKpS3a3cgAn9NDzSq8N9JxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed2781b70f0f44e378dd7f6a7d909843b38b3ba409d4771bd8fd34506b32ebb4","last_reissued_at":"2026-05-18T03:33:35.820388Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:35.820388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.3763","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-18T03:33:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AvpMshz6xpP2st22V+FpQmE7jejDa7bU++/5rQUtcK64HNh4ohhFGZjuU7NbYnRhmiGfq3KQjrv9bfsq1niWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:06:35.784021Z"},"content_sha256":"a4707eba015dd29286756faf2edce27a67085abf01df729cc51bd25a7d94f3e3","schema_version":"1.0","event_id":"sha256:a4707eba015dd29286756faf2edce27a67085abf01df729cc51bd25a7d94f3e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5UTYDNYPB5COG6G5P5VH3EEYIO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster exponential-time algorithms in graphs of bounded average degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Marcin Pilipczuk, Marek Cygan","submitted_at":"2013-02-15T14:41:00Z","abstract_excerpt":"We first show that the Traveling Salesman Problem in an n-vertex graph with average degree bounded by d can be solved in O*(2^{(1-\\eps_d)n}) time and exponential space for a constant \\eps_d depending only on d, where the O*-notation suppresses factors polynomial in the input size. Thus, we generalize the recent results of Bjorklund et al. [TALG 2012] on graphs of bounded degree.\n  Then, we move to the problem of counting perfect matchings in a graph. We first present a simple algorithm for counting perfect matchings in an n-vertex graph in O*(2^{n/2}) time and polynomial space; our algorithm m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3763","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-18T03:33:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uoJQveuJnFGQq/C6cFM0i53QfKRSa0ZJsLxPt5wT35biyfEGbJ9+Qp5sDFHtdONkJY/j7vZjQFl1en3efFrNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:06:35.784841Z"},"content_sha256":"50c9f35531667383d0fc076377de35e3d199ec6dea8f96a96fa0862c067f44e6","schema_version":"1.0","event_id":"sha256:50c9f35531667383d0fc076377de35e3d199ec6dea8f96a96fa0862c067f44e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5UTYDNYPB5COG6G5P5VH3EEYIO/bundle.json","state_url":"https://pith.science/pith/5UTYDNYPB5COG6G5P5VH3EEYIO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5UTYDNYPB5COG6G5P5VH3EEYIO/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-31T19:06:35Z","links":{"resolver":"https://pith.science/pith/5UTYDNYPB5COG6G5P5VH3EEYIO","bundle":"https://pith.science/pith/5UTYDNYPB5COG6G5P5VH3EEYIO/bundle.json","state":"https://pith.science/pith/5UTYDNYPB5COG6G5P5VH3EEYIO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5UTYDNYPB5COG6G5P5VH3EEYIO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5UTYDNYPB5COG6G5P5VH3EEYIO","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":"c3cdb13e809b634043b45b1e34bc307066654f4929e52a8c2d11d43333f79053","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-15T14:41:00Z","title_canon_sha256":"9e86a28840680937ddd9e720a723bb666c46dff27eda66a1fa6d60adda6198ab"},"schema_version":"1.0","source":{"id":"1302.3763","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3763","created_at":"2026-05-18T03:33:35Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3763v1","created_at":"2026-05-18T03:33:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3763","created_at":"2026-05-18T03:33:35Z"},{"alias_kind":"pith_short_12","alias_value":"5UTYDNYPB5CO","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5UTYDNYPB5COG6G5","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5UTYDNYP","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:50c9f35531667383d0fc076377de35e3d199ec6dea8f96a96fa0862c067f44e6","target":"graph","created_at":"2026-05-18T03:33:35Z","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 first show that the Traveling Salesman Problem in an n-vertex graph with average degree bounded by d can be solved in O*(2^{(1-\\eps_d)n}) time and exponential space for a constant \\eps_d depending only on d, where the O*-notation suppresses factors polynomial in the input size. Thus, we generalize the recent results of Bjorklund et al. [TALG 2012] on graphs of bounded degree.\n  Then, we move to the problem of counting perfect matchings in a graph. We first present a simple algorithm for counting perfect matchings in an n-vertex graph in O*(2^{n/2}) time and polynomial space; our algorithm m","authors_text":"Marcin Pilipczuk, Marek Cygan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-15T14:41:00Z","title":"Faster exponential-time algorithms in graphs of bounded average degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3763","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:a4707eba015dd29286756faf2edce27a67085abf01df729cc51bd25a7d94f3e3","target":"record","created_at":"2026-05-18T03:33:35Z","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":"c3cdb13e809b634043b45b1e34bc307066654f4929e52a8c2d11d43333f79053","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-15T14:41:00Z","title_canon_sha256":"9e86a28840680937ddd9e720a723bb666c46dff27eda66a1fa6d60adda6198ab"},"schema_version":"1.0","source":{"id":"1302.3763","kind":"arxiv","version":1}},"canonical_sha256":"ed2781b70f0f44e378dd7f6a7d909843b38b3ba409d4771bd8fd34506b32ebb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed2781b70f0f44e378dd7f6a7d909843b38b3ba409d4771bd8fd34506b32ebb4","first_computed_at":"2026-05-18T03:33:35.820388Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:35.820388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jrHCB4I5HK6b9i28amsZxE0B8mQG+i1wg+qavoNG93ZiK9xFM7QZZ2gOlnYLe+wKpS3a3cgAn9NDzSq8N9JxCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:35.821088Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3763","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4707eba015dd29286756faf2edce27a67085abf01df729cc51bd25a7d94f3e3","sha256:50c9f35531667383d0fc076377de35e3d199ec6dea8f96a96fa0862c067f44e6"],"state_sha256":"6a30b016b48db07ba4a52c8c78fe0a15750ebf88955ed0e00855c49c8b97659b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7T8Ump+42eDw8H1uNRqv/Mmk4VtbKN7gBI2JOGEi7mUnM7mys5AHX7BtdmfTbgvPpkWUkB0X82u/8A4UsOREAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:06:35.788639Z","bundle_sha256":"e09bee3709499a4c94f90e429ad1f43f03d4d951ec2c1383e10f0ef997bb2185"}}