{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WSOGICNOTVFOVMYPMIHJIX5Q3G","short_pith_number":"pith:WSOGICNO","schema_version":"1.0","canonical_sha256":"b49c6409ae9d4aeab30f620e945fb0d9909965f9a032830283ee36e490caf403","source":{"kind":"arxiv","id":"1510.00598","version":1},"attestation_state":"computed","paper":{"title":"On independent set on B1-EPG graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cristophe Paul, Daniel Gon\\c{c}alves, Marin Bougeret, Stephane Bessy","submitted_at":"2015-10-02T13:55:34Z","abstract_excerpt":"In this paper we consider the Maximum Independent Set problem (MIS) on $B_1$-EPG graphs. EPG (for Edge intersection graphs of Paths on a Grid) was introduced in ~\\cite{edgeintersinglebend} as the class of graphs whose vertices can be represented as simple paths on a rectangular grid so that two vertices are adjacent if and only if the corresponding paths share at least one edge of the underlying grid. The restricted class $B_k$-EPG denotes EPG-graphs where every path has at most $k$ bends. The study of MIS on $B_1$-EPG graphs has been initiated in~\\cite{wadsMIS} where authors prove that MIS is"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1510.00598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-02T13:55:34Z","cross_cats_sorted":[],"title_canon_sha256":"609f4c451e8506ec7d1254d103bfe95ae023b255e74092318dbbc95422d4b09c","abstract_canon_sha256":"545f9ee241f31ef91db3104b05f145450e04fcc2a7b478a0291730b6566e56d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:12.533280Z","signature_b64":"CDFHiSbhaH51JGhmLQAt6ukGMO59AfEfC1rQH9fuXeELGGbua5+MFpyyDaUBSDOvmBjmwQk+RgSYc293Th7ZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b49c6409ae9d4aeab30f620e945fb0d9909965f9a032830283ee36e490caf403","last_reissued_at":"2026-05-18T01:31:12.532549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:12.532549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On independent set on B1-EPG graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cristophe Paul, Daniel Gon\\c{c}alves, Marin Bougeret, Stephane Bessy","submitted_at":"2015-10-02T13:55:34Z","abstract_excerpt":"In this paper we consider the Maximum Independent Set problem (MIS) on $B_1$-EPG graphs. EPG (for Edge intersection graphs of Paths on a Grid) was introduced in ~\\cite{edgeintersinglebend} as the class of graphs whose vertices can be represented as simple paths on a rectangular grid so that two vertices are adjacent if and only if the corresponding paths share at least one edge of the underlying grid. The restricted class $B_k$-EPG denotes EPG-graphs where every path has at most $k$ bends. The study of MIS on $B_1$-EPG graphs has been initiated in~\\cite{wadsMIS} where authors prove that MIS is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00598","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1510.00598","created_at":"2026-05-18T01:31:12.532674+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.00598v1","created_at":"2026-05-18T01:31:12.532674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00598","created_at":"2026-05-18T01:31:12.532674+00:00"},{"alias_kind":"pith_short_12","alias_value":"WSOGICNOTVFO","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WSOGICNOTVFOVMYP","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WSOGICNO","created_at":"2026-05-18T12:29:47.479230+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WSOGICNOTVFOVMYPMIHJIX5Q3G","json":"https://pith.science/pith/WSOGICNOTVFOVMYPMIHJIX5Q3G.json","graph_json":"https://pith.science/api/pith-number/WSOGICNOTVFOVMYPMIHJIX5Q3G/graph.json","events_json":"https://pith.science/api/pith-number/WSOGICNOTVFOVMYPMIHJIX5Q3G/events.json","paper":"https://pith.science/paper/WSOGICNO"},"agent_actions":{"view_html":"https://pith.science/pith/WSOGICNOTVFOVMYPMIHJIX5Q3G","download_json":"https://pith.science/pith/WSOGICNOTVFOVMYPMIHJIX5Q3G.json","view_paper":"https://pith.science/paper/WSOGICNO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.00598&json=true","fetch_graph":"https://pith.science/api/pith-number/WSOGICNOTVFOVMYPMIHJIX5Q3G/graph.json","fetch_events":"https://pith.science/api/pith-number/WSOGICNOTVFOVMYPMIHJIX5Q3G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WSOGICNOTVFOVMYPMIHJIX5Q3G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WSOGICNOTVFOVMYPMIHJIX5Q3G/action/storage_attestation","attest_author":"https://pith.science/pith/WSOGICNOTVFOVMYPMIHJIX5Q3G/action/author_attestation","sign_citation":"https://pith.science/pith/WSOGICNOTVFOVMYPMIHJIX5Q3G/action/citation_signature","submit_replication":"https://pith.science/pith/WSOGICNOTVFOVMYPMIHJIX5Q3G/action/replication_record"}},"created_at":"2026-05-18T01:31:12.532674+00:00","updated_at":"2026-05-18T01:31:12.532674+00:00"}