{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZECDFU6ZGNFVV342NWCPV4VJKP","short_pith_number":"pith:ZECDFU6Z","canonical_record":{"source":{"id":"1505.04918","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-19T09:19:39Z","cross_cats_sorted":[],"title_canon_sha256":"f63380d66724774d97758e6a35259d265e38a370eeca49a4637780698f6db5da","abstract_canon_sha256":"75f0edd155a7f2b037915096cc7abbd132f9318742e769479194dab981b97574"},"schema_version":"1.0"},"canonical_sha256":"c90432d3d9334b5aef9a6d84faf2a953c804f985f613d3efb22ddd51338ffa20","source":{"kind":"arxiv","id":"1505.04918","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04918","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04918v2","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04918","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"pith_short_12","alias_value":"ZECDFU6ZGNFV","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZECDFU6ZGNFVV342","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZECDFU6Z","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZECDFU6ZGNFVV342NWCPV4VJKP","target":"record","payload":{"canonical_record":{"source":{"id":"1505.04918","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-19T09:19:39Z","cross_cats_sorted":[],"title_canon_sha256":"f63380d66724774d97758e6a35259d265e38a370eeca49a4637780698f6db5da","abstract_canon_sha256":"75f0edd155a7f2b037915096cc7abbd132f9318742e769479194dab981b97574"},"schema_version":"1.0"},"canonical_sha256":"c90432d3d9334b5aef9a6d84faf2a953c804f985f613d3efb22ddd51338ffa20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:52.344265Z","signature_b64":"+BZMAF8JHnS6LtReC4ncnjcDeDSJO4LbFxONenc7uQj34bKduiMm3A68vdCFw15Lx8ulUDexmCKbx8Le2g22Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c90432d3d9334b5aef9a6d84faf2a953c804f985f613d3efb22ddd51338ffa20","last_reissued_at":"2026-05-18T01:55:52.343591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:52.343591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.04918","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:55:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4kgtWWpBzsrqErETHxAAM+TCxIp3Iu7Tj+QQFjnxWLStaK9DcIYs9ydCJ5qA6AYy245/CfliZ+qsc4il3u+uCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:19:36.583087Z"},"content_sha256":"759948baccc39a9804340d84169bd63f6a0034901f23d1de01760f357d22f314","schema_version":"1.0","event_id":"sha256:759948baccc39a9804340d84169bd63f6a0034901f23d1de01760f357d22f314"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZECDFU6ZGNFVV342NWCPV4VJKP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sublinear Approximation Algorithms for Boxicity and Related Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Abhijin Adiga, Jasine Babu, L. Sunil Chandran","submitted_at":"2015-05-19T09:19:39Z","abstract_excerpt":"Boxicity of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes in $\\mathbb{R}^k$. Cubicity is a variant of boxicity, where the axis parallel boxes in the intersection representation are restricted to be of unit length sides. Deciding whether boxicity (resp. cubicity) of a graph is at most k is NP-hard, even for k=2 or 3. Computing these parameters is inapproximable within $O(n^{1 - \\epsilon})$-factor, for any $\\epsilon >0$ in polynomial time unless NP=ZPP, even for many simple graph classes.\n  In this paper, we give a polyno"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04918","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:55:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0tBQHqf96fTNQ5a0lv1UDykkhVhr5COcTlXD7mC9coBfgKjmPMMBSMDo1ndeGS4wcKC07aiktGEQGKf3he2WDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:19:36.583438Z"},"content_sha256":"7e2b372f02482ae02c4e6e708aa59986364544e67cdd8d14e9a98fb347afb7b1","schema_version":"1.0","event_id":"sha256:7e2b372f02482ae02c4e6e708aa59986364544e67cdd8d14e9a98fb347afb7b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZECDFU6ZGNFVV342NWCPV4VJKP/bundle.json","state_url":"https://pith.science/pith/ZECDFU6ZGNFVV342NWCPV4VJKP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZECDFU6ZGNFVV342NWCPV4VJKP/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-01T07:19:36Z","links":{"resolver":"https://pith.science/pith/ZECDFU6ZGNFVV342NWCPV4VJKP","bundle":"https://pith.science/pith/ZECDFU6ZGNFVV342NWCPV4VJKP/bundle.json","state":"https://pith.science/pith/ZECDFU6ZGNFVV342NWCPV4VJKP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZECDFU6ZGNFVV342NWCPV4VJKP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZECDFU6ZGNFVV342NWCPV4VJKP","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":"75f0edd155a7f2b037915096cc7abbd132f9318742e769479194dab981b97574","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-19T09:19:39Z","title_canon_sha256":"f63380d66724774d97758e6a35259d265e38a370eeca49a4637780698f6db5da"},"schema_version":"1.0","source":{"id":"1505.04918","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04918","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04918v2","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04918","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"pith_short_12","alias_value":"ZECDFU6ZGNFV","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZECDFU6ZGNFVV342","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZECDFU6Z","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:7e2b372f02482ae02c4e6e708aa59986364544e67cdd8d14e9a98fb347afb7b1","target":"graph","created_at":"2026-05-18T01:55:52Z","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":"Boxicity of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes in $\\mathbb{R}^k$. Cubicity is a variant of boxicity, where the axis parallel boxes in the intersection representation are restricted to be of unit length sides. Deciding whether boxicity (resp. cubicity) of a graph is at most k is NP-hard, even for k=2 or 3. Computing these parameters is inapproximable within $O(n^{1 - \\epsilon})$-factor, for any $\\epsilon >0$ in polynomial time unless NP=ZPP, even for many simple graph classes.\n  In this paper, we give a polyno","authors_text":"Abhijin Adiga, Jasine Babu, L. Sunil Chandran","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-19T09:19:39Z","title":"Sublinear Approximation Algorithms for Boxicity and Related Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04918","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:759948baccc39a9804340d84169bd63f6a0034901f23d1de01760f357d22f314","target":"record","created_at":"2026-05-18T01:55:52Z","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":"75f0edd155a7f2b037915096cc7abbd132f9318742e769479194dab981b97574","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-19T09:19:39Z","title_canon_sha256":"f63380d66724774d97758e6a35259d265e38a370eeca49a4637780698f6db5da"},"schema_version":"1.0","source":{"id":"1505.04918","kind":"arxiv","version":2}},"canonical_sha256":"c90432d3d9334b5aef9a6d84faf2a953c804f985f613d3efb22ddd51338ffa20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c90432d3d9334b5aef9a6d84faf2a953c804f985f613d3efb22ddd51338ffa20","first_computed_at":"2026-05-18T01:55:52.343591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:52.343591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+BZMAF8JHnS6LtReC4ncnjcDeDSJO4LbFxONenc7uQj34bKduiMm3A68vdCFw15Lx8ulUDexmCKbx8Le2g22Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:52.344265Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.04918","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:759948baccc39a9804340d84169bd63f6a0034901f23d1de01760f357d22f314","sha256:7e2b372f02482ae02c4e6e708aa59986364544e67cdd8d14e9a98fb347afb7b1"],"state_sha256":"025f9e62a43f66aa5e076b7cbd7bd80c4e01e8424c9503748d11a5f7b1c511c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T+FMcs8fn93VOUmQU9/4NcDfr0UU6MerJx0ySwyl3xr4Fz0vvfxGAmDJeP3Y9hFNrleRv31N3a1JxZV+dIkmDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T07:19:36.585464Z","bundle_sha256":"1f65ec26555cf95b7f6df3b3207a0e84bce43364e6f2ef24d2b419dbea0226b1"}}