{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:C4V4HJ3K5D2RHGV3Y3KOSJ4HK4","short_pith_number":"pith:C4V4HJ3K","canonical_record":{"source":{"id":"1611.05991","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-18T07:05:00Z","cross_cats_sorted":[],"title_canon_sha256":"57f029812f2b2cb4a7397cace7e965b98762ff5f9648fc5af1f6c3eb0b7e9e44","abstract_canon_sha256":"b8da14f5a16c397b34d7a106740252c9cd325bb7bcbfcbf9924b589c354f7f60"},"schema_version":"1.0"},"canonical_sha256":"172bc3a76ae8f5139abbc6d4e9278757318899a9b5de166d265b62ba77b377ef","source":{"kind":"arxiv","id":"1611.05991","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05991","created_at":"2026-05-18T00:46:48Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05991v2","created_at":"2026-05-18T00:46:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05991","created_at":"2026-05-18T00:46:48Z"},{"alias_kind":"pith_short_12","alias_value":"C4V4HJ3K5D2R","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C4V4HJ3K5D2RHGV3","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C4V4HJ3K","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:C4V4HJ3K5D2RHGV3Y3KOSJ4HK4","target":"record","payload":{"canonical_record":{"source":{"id":"1611.05991","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-18T07:05:00Z","cross_cats_sorted":[],"title_canon_sha256":"57f029812f2b2cb4a7397cace7e965b98762ff5f9648fc5af1f6c3eb0b7e9e44","abstract_canon_sha256":"b8da14f5a16c397b34d7a106740252c9cd325bb7bcbfcbf9924b589c354f7f60"},"schema_version":"1.0"},"canonical_sha256":"172bc3a76ae8f5139abbc6d4e9278757318899a9b5de166d265b62ba77b377ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:48.801413Z","signature_b64":"TwgLcQmXM4oGpccvZv2M4438vjb7M9jcliiNfMByp1iHLPq0jZWnkGQ1U15D1Y6XsZ4TcCa1KycFdst5vsD/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"172bc3a76ae8f5139abbc6d4e9278757318899a9b5de166d265b62ba77b377ef","last_reissued_at":"2026-05-18T00:46:48.800774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:48.800774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.05991","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-18T00:46:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+6Og7PwPi9OExfTlsGAQU7gsXAIpRthMb0mXhlb4cTNyt8NkJn5Sc+iJ2nI8jI0R4VWrFgCnt0f3xN+XtZyVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:37:58.904082Z"},"content_sha256":"1be58ada42f5613e4ab147abc8a8d846b411007a9aec1b5469cdc84e50638991","schema_version":"1.0","event_id":"sha256:1be58ada42f5613e4ab147abc8a8d846b411007a9aec1b5469cdc84e50638991"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:C4V4HJ3K5D2RHGV3Y3KOSJ4HK4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost-Polynomial Ratio ETH-Hardness of Approximating Densest $k$-Subgraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Pasin Manurangsi","submitted_at":"2016-11-18T07:05:00Z","abstract_excerpt":"In the Densest $k$-Subgraph problem, given an undirected graph $G$ and an integer $k$, the goal is to find a subgraph of $G$ on $k$ vertices that contains maximum number of edges. Even though the state-of-the-art algorithm for the problem achieves only $O(n^{1/4 + \\varepsilon})$ approximation ratio (Bhaskara et al., 2010), previous attempts at proving hardness of approximation, including those under average case assumptions, fail to achieve a polynomial ratio; the best ratios ruled out under any worst case assumption and any average case assumption are only any constant (Raghavendra and Steure"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05991","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-18T00:46:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XSxxCuLJShibBFC/aK8ayhfQdM4bT+AeXrhRCBQfSVek6t0OigHWvEBmasZV0bW8RXDEg35NJ0rtFa5xc3m9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:37:58.904439Z"},"content_sha256":"ee8a9a7f0e12a684ce1ae328f7caed172f0be8c90302ec108905945c5287c15d","schema_version":"1.0","event_id":"sha256:ee8a9a7f0e12a684ce1ae328f7caed172f0be8c90302ec108905945c5287c15d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C4V4HJ3K5D2RHGV3Y3KOSJ4HK4/bundle.json","state_url":"https://pith.science/pith/C4V4HJ3K5D2RHGV3Y3KOSJ4HK4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C4V4HJ3K5D2RHGV3Y3KOSJ4HK4/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-01T23:37:58Z","links":{"resolver":"https://pith.science/pith/C4V4HJ3K5D2RHGV3Y3KOSJ4HK4","bundle":"https://pith.science/pith/C4V4HJ3K5D2RHGV3Y3KOSJ4HK4/bundle.json","state":"https://pith.science/pith/C4V4HJ3K5D2RHGV3Y3KOSJ4HK4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C4V4HJ3K5D2RHGV3Y3KOSJ4HK4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:C4V4HJ3K5D2RHGV3Y3KOSJ4HK4","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":"b8da14f5a16c397b34d7a106740252c9cd325bb7bcbfcbf9924b589c354f7f60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-18T07:05:00Z","title_canon_sha256":"57f029812f2b2cb4a7397cace7e965b98762ff5f9648fc5af1f6c3eb0b7e9e44"},"schema_version":"1.0","source":{"id":"1611.05991","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05991","created_at":"2026-05-18T00:46:48Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05991v2","created_at":"2026-05-18T00:46:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05991","created_at":"2026-05-18T00:46:48Z"},{"alias_kind":"pith_short_12","alias_value":"C4V4HJ3K5D2R","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C4V4HJ3K5D2RHGV3","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C4V4HJ3K","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:ee8a9a7f0e12a684ce1ae328f7caed172f0be8c90302ec108905945c5287c15d","target":"graph","created_at":"2026-05-18T00:46:48Z","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":"In the Densest $k$-Subgraph problem, given an undirected graph $G$ and an integer $k$, the goal is to find a subgraph of $G$ on $k$ vertices that contains maximum number of edges. Even though the state-of-the-art algorithm for the problem achieves only $O(n^{1/4 + \\varepsilon})$ approximation ratio (Bhaskara et al., 2010), previous attempts at proving hardness of approximation, including those under average case assumptions, fail to achieve a polynomial ratio; the best ratios ruled out under any worst case assumption and any average case assumption are only any constant (Raghavendra and Steure","authors_text":"Pasin Manurangsi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-18T07:05:00Z","title":"Almost-Polynomial Ratio ETH-Hardness of Approximating Densest $k$-Subgraph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05991","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:1be58ada42f5613e4ab147abc8a8d846b411007a9aec1b5469cdc84e50638991","target":"record","created_at":"2026-05-18T00:46:48Z","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":"b8da14f5a16c397b34d7a106740252c9cd325bb7bcbfcbf9924b589c354f7f60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-18T07:05:00Z","title_canon_sha256":"57f029812f2b2cb4a7397cace7e965b98762ff5f9648fc5af1f6c3eb0b7e9e44"},"schema_version":"1.0","source":{"id":"1611.05991","kind":"arxiv","version":2}},"canonical_sha256":"172bc3a76ae8f5139abbc6d4e9278757318899a9b5de166d265b62ba77b377ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"172bc3a76ae8f5139abbc6d4e9278757318899a9b5de166d265b62ba77b377ef","first_computed_at":"2026-05-18T00:46:48.800774Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:48.800774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TwgLcQmXM4oGpccvZv2M4438vjb7M9jcliiNfMByp1iHLPq0jZWnkGQ1U15D1Y6XsZ4TcCa1KycFdst5vsD/Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:48.801413Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.05991","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1be58ada42f5613e4ab147abc8a8d846b411007a9aec1b5469cdc84e50638991","sha256:ee8a9a7f0e12a684ce1ae328f7caed172f0be8c90302ec108905945c5287c15d"],"state_sha256":"331ad0b1cc3928a455ccc75f9ad3082e4362fa3c23a2fd1af7226e9a61ca7f10"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ea2K6vaQNUdDoMbMk9SezaxmuzKAno0T7dUhRfCIiGwkG/44K/arXvkxhvLIhViiFkXrwsupbClEWgR9TTqDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:37:58.906383Z","bundle_sha256":"eed79919fa7b725ebfa45ab223d7567763cde188d49ad903021b5573bc94dcee"}}