{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FPBK557XMTBWYMP67R3ZVV6N5T","short_pith_number":"pith:FPBK557X","canonical_record":{"source":{"id":"1908.01981","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-06T06:51:58Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"72af31dde815c679107cf96fefd59e83403428f59dd92dd622785aaff64df9c9","abstract_canon_sha256":"20bb2cbea1da6ef89a4f3f3388dc644e0a8ad4aadd2d31cc1390106b2a903cd3"},"schema_version":"1.0"},"canonical_sha256":"2bc2aef7f764c36c31fefc779ad7cdecd4e4be4e6ae73cf0c4eeb0fd72dd4f50","source":{"kind":"arxiv","id":"1908.01981","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01981","created_at":"2026-07-05T05:28:58Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01981v4","created_at":"2026-07-05T05:28:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01981","created_at":"2026-07-05T05:28:58Z"},{"alias_kind":"pith_short_12","alias_value":"FPBK557XMTBW","created_at":"2026-07-05T05:28:58Z"},{"alias_kind":"pith_short_16","alias_value":"FPBK557XMTBWYMP6","created_at":"2026-07-05T05:28:58Z"},{"alias_kind":"pith_short_8","alias_value":"FPBK557X","created_at":"2026-07-05T05:28:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FPBK557XMTBWYMP67R3ZVV6N5T","target":"record","payload":{"canonical_record":{"source":{"id":"1908.01981","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-06T06:51:58Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"72af31dde815c679107cf96fefd59e83403428f59dd92dd622785aaff64df9c9","abstract_canon_sha256":"20bb2cbea1da6ef89a4f3f3388dc644e0a8ad4aadd2d31cc1390106b2a903cd3"},"schema_version":"1.0"},"canonical_sha256":"2bc2aef7f764c36c31fefc779ad7cdecd4e4be4e6ae73cf0c4eeb0fd72dd4f50","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:28:58.211779Z","signature_b64":"2H9T9r8aUCjML7cgCsZLOOZ46g9EqML8gr4FSkCrQ/501EHlsvV+Ueukc/nv+rUgmeR5oZfDjdnNDfZkI4liCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bc2aef7f764c36c31fefc779ad7cdecd4e4be4e6ae73cf0c4eeb0fd72dd4f50","last_reissued_at":"2026-07-05T05:28:58.211397Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:28:58.211397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.01981","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-07-05T05:28:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZSYJ7+Vn8enT3FvuFM26aNozNYouJ9fyfia1KfiXM+U63T6uRKT2dSPs8pR/VGPS3F57XcmTJk76TYdRyrY1CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:24:22.530751Z"},"content_sha256":"e6de9895bac7c6820c259c4f7105975ca80ee1705c2bcdf7ac95adc0c3b0cc8c","schema_version":"1.0","event_id":"sha256:e6de9895bac7c6820c259c4f7105975ca80ee1705c2bcdf7ac95adc0c3b0cc8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FPBK557XMTBWYMP67R3ZVV6N5T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Elisabeth Gaar, Eranda Cela","submitted_at":"2019-08-06T06:51:58Z","abstract_excerpt":"In a representation of a graph $G$ as an edge intersection graph of paths on a grid (EPG) every vertex of $G$ is represented by a path on a grid and two paths share a grid edge iff the corresponding vertices are adjacent. In a monotonic EPG representation every path on the grid is ascending in both rows and columns. In a (monotonic) $B_k$-EPG representation every path on the grid has at most $k$ bends. The (monotonic) bend number $b(G)$ ($b^m(G)$) of a graph $G$ is the smallest natural number $k$ for which there exists a (monotonic) $B_k$-EPG representation of $G$.\n  In this paper we deal with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01981","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.01981/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:28:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ufFoPrdrKvBfV3xFK2kND7KZijYX9krt/c5fX44wfqWIa+hzdEQRSVJqKpqYXjaIcB9gcfVXzLR0lYb4sEYyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:24:22.531280Z"},"content_sha256":"ff89910f608891d71455ae223aa27b0d3facea9d364c23ea1ec413c0926a6444","schema_version":"1.0","event_id":"sha256:ff89910f608891d71455ae223aa27b0d3facea9d364c23ea1ec413c0926a6444"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FPBK557XMTBWYMP67R3ZVV6N5T/bundle.json","state_url":"https://pith.science/pith/FPBK557XMTBWYMP67R3ZVV6N5T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FPBK557XMTBWYMP67R3ZVV6N5T/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-08-16T05:24:22Z","links":{"resolver":"https://pith.science/pith/FPBK557XMTBWYMP67R3ZVV6N5T","bundle":"https://pith.science/pith/FPBK557XMTBWYMP67R3ZVV6N5T/bundle.json","state":"https://pith.science/pith/FPBK557XMTBWYMP67R3ZVV6N5T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FPBK557XMTBWYMP67R3ZVV6N5T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FPBK557XMTBWYMP67R3ZVV6N5T","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":"20bb2cbea1da6ef89a4f3f3388dc644e0a8ad4aadd2d31cc1390106b2a903cd3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-06T06:51:58Z","title_canon_sha256":"72af31dde815c679107cf96fefd59e83403428f59dd92dd622785aaff64df9c9"},"schema_version":"1.0","source":{"id":"1908.01981","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01981","created_at":"2026-07-05T05:28:58Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01981v4","created_at":"2026-07-05T05:28:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01981","created_at":"2026-07-05T05:28:58Z"},{"alias_kind":"pith_short_12","alias_value":"FPBK557XMTBW","created_at":"2026-07-05T05:28:58Z"},{"alias_kind":"pith_short_16","alias_value":"FPBK557XMTBWYMP6","created_at":"2026-07-05T05:28:58Z"},{"alias_kind":"pith_short_8","alias_value":"FPBK557X","created_at":"2026-07-05T05:28:58Z"}],"graph_snapshots":[{"event_id":"sha256:ff89910f608891d71455ae223aa27b0d3facea9d364c23ea1ec413c0926a6444","target":"graph","created_at":"2026-07-05T05:28:58Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.01981/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In a representation of a graph $G$ as an edge intersection graph of paths on a grid (EPG) every vertex of $G$ is represented by a path on a grid and two paths share a grid edge iff the corresponding vertices are adjacent. In a monotonic EPG representation every path on the grid is ascending in both rows and columns. In a (monotonic) $B_k$-EPG representation every path on the grid has at most $k$ bends. The (monotonic) bend number $b(G)$ ($b^m(G)$) of a graph $G$ is the smallest natural number $k$ for which there exists a (monotonic) $B_k$-EPG representation of $G$.\n  In this paper we deal with","authors_text":"Elisabeth Gaar, Eranda Cela","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-06T06:51:58Z","title":"Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01981","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:e6de9895bac7c6820c259c4f7105975ca80ee1705c2bcdf7ac95adc0c3b0cc8c","target":"record","created_at":"2026-07-05T05:28:58Z","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":"20bb2cbea1da6ef89a4f3f3388dc644e0a8ad4aadd2d31cc1390106b2a903cd3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-06T06:51:58Z","title_canon_sha256":"72af31dde815c679107cf96fefd59e83403428f59dd92dd622785aaff64df9c9"},"schema_version":"1.0","source":{"id":"1908.01981","kind":"arxiv","version":4}},"canonical_sha256":"2bc2aef7f764c36c31fefc779ad7cdecd4e4be4e6ae73cf0c4eeb0fd72dd4f50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bc2aef7f764c36c31fefc779ad7cdecd4e4be4e6ae73cf0c4eeb0fd72dd4f50","first_computed_at":"2026-07-05T05:28:58.211397Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:28:58.211397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2H9T9r8aUCjML7cgCsZLOOZ46g9EqML8gr4FSkCrQ/501EHlsvV+Ueukc/nv+rUgmeR5oZfDjdnNDfZkI4liCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:28:58.211779Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.01981","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6de9895bac7c6820c259c4f7105975ca80ee1705c2bcdf7ac95adc0c3b0cc8c","sha256:ff89910f608891d71455ae223aa27b0d3facea9d364c23ea1ec413c0926a6444"],"state_sha256":"a517b310ffd21d3dfe138fe19b7f5493cd3a3e8245b5388bd5f99c55204f3be5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8R/YQxOohAA2ZB1aEkjBKxqhDnzJIlHx/uDok7ja3FT2FmCpj92U9w9HW27STA6kEf/NChjJ37tNVJgbUH9rCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T05:24:22.535418Z","bundle_sha256":"8fab5b34bfed7d924ba2ff524d9596cef79387e7bbd37294fa7aeb9991afee45"}}