{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7FMN4ATDORB2WEFQKCBH4LKMQR","short_pith_number":"pith:7FMN4ATD","canonical_record":{"source":{"id":"1704.08620","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T15:18:03Z","cross_cats_sorted":[],"title_canon_sha256":"fad890282fc77d628b79644182374608db88d7fef43267c9bd202c947d44c0b3","abstract_canon_sha256":"9835a30a640a56df89eaeadbabd502c14a42d9246b26d2d40b4d1a31f7d7fe3b"},"schema_version":"1.0"},"canonical_sha256":"f958de02637443ab10b050827e2d4c845672dbb472c716b31bc5ed9e2d33591e","source":{"kind":"arxiv","id":"1704.08620","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08620","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08620v4","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08620","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"7FMN4ATDORB2","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7FMN4ATDORB2WEFQ","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7FMN4ATD","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7FMN4ATDORB2WEFQKCBH4LKMQR","target":"record","payload":{"canonical_record":{"source":{"id":"1704.08620","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T15:18:03Z","cross_cats_sorted":[],"title_canon_sha256":"fad890282fc77d628b79644182374608db88d7fef43267c9bd202c947d44c0b3","abstract_canon_sha256":"9835a30a640a56df89eaeadbabd502c14a42d9246b26d2d40b4d1a31f7d7fe3b"},"schema_version":"1.0"},"canonical_sha256":"f958de02637443ab10b050827e2d4c845672dbb472c716b31bc5ed9e2d33591e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:11.754084Z","signature_b64":"0dB0+yNablciPXeLyczjnxiIdJtl9gW+VBlaKfRlcGHca+hycPgATNT3TLFVfCtayLOac4PGyT/dagebvibbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f958de02637443ab10b050827e2d4c845672dbb472c716b31bc5ed9e2d33591e","last_reissued_at":"2026-05-18T00:25:11.753466Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:11.753466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.08620","source_version":4,"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:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UNRVXiQJyfNWdsz66DWL9XWGL7Mt0UUveUUpgOpnwzHfPoh8M9PoQYn1DC7ZcHa/P+TSkJeUEqSltlj1zMreCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T11:58:44.978511Z"},"content_sha256":"2df7876e8d48d24b437b76026e3ac34b76a626735f847da19092a42f9242c6a9","schema_version":"1.0","event_id":"sha256:2df7876e8d48d24b437b76026e3ac34b76a626735f847da19092a42f9242c6a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7FMN4ATDORB2WEFQKCBH4LKMQR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved approximation algorithm for the Dense-3-Subhypergraph Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amey Bhangale, Guy Kortsarz, Rajiv Gandhi","submitted_at":"2017-04-27T15:18:03Z","abstract_excerpt":"The study of Dense-$3$-Subhypergraph problem was initiated in Chlamt{\\'{a}}c et al. [Approx'16]. The input is a universe $U$ and collection ${\\cal S}$ of subsets of $U$, each of size $3$, and a number $k$. The goal is to choose a set $W$ of $k$ elements from the universe, and maximize the number of sets, $S\\in {\\cal S}$ so that $S\\subseteq W$. The members in $U$ are called {\\em vertices} and the sets of ${\\cal S}$ are called the {\\em hyperedges}. This is the simplest extension into hyperedges of the case of sets of size $2$ which is the well known Dense $k$-subgraph problem.\n  The best known r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08620","kind":"arxiv","version":4},"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:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HAWpk8z9x5XE5IlMe8D1em6j7GUOs9bbnEktKJQgzJX2zSikIL3G8Io/UU3DvpGRr+NORNm+shbjm6osHmqgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T11:58:44.978859Z"},"content_sha256":"df1889c06a9a1ee5f828c7035dbb389a6eb6d000528fd97129c342926b0f6af2","schema_version":"1.0","event_id":"sha256:df1889c06a9a1ee5f828c7035dbb389a6eb6d000528fd97129c342926b0f6af2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FMN4ATDORB2WEFQKCBH4LKMQR/bundle.json","state_url":"https://pith.science/pith/7FMN4ATDORB2WEFQKCBH4LKMQR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FMN4ATDORB2WEFQKCBH4LKMQR/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-19T11:58:44Z","links":{"resolver":"https://pith.science/pith/7FMN4ATDORB2WEFQKCBH4LKMQR","bundle":"https://pith.science/pith/7FMN4ATDORB2WEFQKCBH4LKMQR/bundle.json","state":"https://pith.science/pith/7FMN4ATDORB2WEFQKCBH4LKMQR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FMN4ATDORB2WEFQKCBH4LKMQR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7FMN4ATDORB2WEFQKCBH4LKMQR","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":"9835a30a640a56df89eaeadbabd502c14a42d9246b26d2d40b4d1a31f7d7fe3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T15:18:03Z","title_canon_sha256":"fad890282fc77d628b79644182374608db88d7fef43267c9bd202c947d44c0b3"},"schema_version":"1.0","source":{"id":"1704.08620","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08620","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08620v4","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08620","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"7FMN4ATDORB2","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7FMN4ATDORB2WEFQ","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7FMN4ATD","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:df1889c06a9a1ee5f828c7035dbb389a6eb6d000528fd97129c342926b0f6af2","target":"graph","created_at":"2026-05-18T00:25:11Z","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":"The study of Dense-$3$-Subhypergraph problem was initiated in Chlamt{\\'{a}}c et al. [Approx'16]. The input is a universe $U$ and collection ${\\cal S}$ of subsets of $U$, each of size $3$, and a number $k$. The goal is to choose a set $W$ of $k$ elements from the universe, and maximize the number of sets, $S\\in {\\cal S}$ so that $S\\subseteq W$. The members in $U$ are called {\\em vertices} and the sets of ${\\cal S}$ are called the {\\em hyperedges}. This is the simplest extension into hyperedges of the case of sets of size $2$ which is the well known Dense $k$-subgraph problem.\n  The best known r","authors_text":"Amey Bhangale, Guy Kortsarz, Rajiv Gandhi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T15:18:03Z","title":"Improved approximation algorithm for the Dense-3-Subhypergraph Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08620","kind":"arxiv","version":4},"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:2df7876e8d48d24b437b76026e3ac34b76a626735f847da19092a42f9242c6a9","target":"record","created_at":"2026-05-18T00:25:11Z","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":"9835a30a640a56df89eaeadbabd502c14a42d9246b26d2d40b4d1a31f7d7fe3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T15:18:03Z","title_canon_sha256":"fad890282fc77d628b79644182374608db88d7fef43267c9bd202c947d44c0b3"},"schema_version":"1.0","source":{"id":"1704.08620","kind":"arxiv","version":4}},"canonical_sha256":"f958de02637443ab10b050827e2d4c845672dbb472c716b31bc5ed9e2d33591e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f958de02637443ab10b050827e2d4c845672dbb472c716b31bc5ed9e2d33591e","first_computed_at":"2026-05-18T00:25:11.753466Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:11.753466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0dB0+yNablciPXeLyczjnxiIdJtl9gW+VBlaKfRlcGHca+hycPgATNT3TLFVfCtayLOac4PGyT/dagebvibbDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:11.754084Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.08620","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2df7876e8d48d24b437b76026e3ac34b76a626735f847da19092a42f9242c6a9","sha256:df1889c06a9a1ee5f828c7035dbb389a6eb6d000528fd97129c342926b0f6af2"],"state_sha256":"cd5aec9720f54df49b42a00f7ebb59fcc6217e497cbc511d6226d5b94482aa36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AyE+HFXkUP0BSdzctU4yTqHQPNRpweSzFFWuZuYW7RgOx7gyFD8royjP2oUyGx7zc1cOi/BiGUEgln6KpFBlAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T11:58:44.980511Z","bundle_sha256":"aeaf18cf5eef46d5350c34f149d0886739f23d938f25c4c12e6c3e2e83317bb6"}}