{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TNEXSKG4AYTLUXHR5DGDIEZO2Y","short_pith_number":"pith:TNEXSKG4","canonical_record":{"source":{"id":"1710.02013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-10-05T13:36:01Z","cross_cats_sorted":[],"title_canon_sha256":"c7a758aea41487eab4073e69306da0b5827313e9507d1ab0242b83660c9545f2","abstract_canon_sha256":"274f58e18027d1681b6b97c08e0ec2d4dbb66495f2489940feb201f2642f662a"},"schema_version":"1.0"},"canonical_sha256":"9b497928dc0626ba5cf1e8cc34132ed626bb13093c199e3dbf51c74cf4dc1347","source":{"kind":"arxiv","id":"1710.02013","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02013","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02013v1","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02013","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"pith_short_12","alias_value":"TNEXSKG4AYTL","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TNEXSKG4AYTLUXHR","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TNEXSKG4","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TNEXSKG4AYTLUXHR5DGDIEZO2Y","target":"record","payload":{"canonical_record":{"source":{"id":"1710.02013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-10-05T13:36:01Z","cross_cats_sorted":[],"title_canon_sha256":"c7a758aea41487eab4073e69306da0b5827313e9507d1ab0242b83660c9545f2","abstract_canon_sha256":"274f58e18027d1681b6b97c08e0ec2d4dbb66495f2489940feb201f2642f662a"},"schema_version":"1.0"},"canonical_sha256":"9b497928dc0626ba5cf1e8cc34132ed626bb13093c199e3dbf51c74cf4dc1347","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:37.779726Z","signature_b64":"Nk9hDWuDvpv2OjzOPFHOZPR6urlAk64Ysevucg67+n90JcSdLmq+oHOt8Y+h5BUfL2/32FVYO4TR5hiP8C+aBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b497928dc0626ba5cf1e8cc34132ed626bb13093c199e3dbf51c74cf4dc1347","last_reissued_at":"2026-05-18T00:33:37.779029Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:37.779029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.02013","source_version":1,"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:33:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GXGMML9xBGOjiKJrymaDNvDmhutrw/Z8i6HCaBHIwMdiGgLAfSWArKYwT8vsPm/4D1lDfnuTmwLmflxIqw/uCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:14:20.016787Z"},"content_sha256":"3f9a04288be2613accb4842708c53028ad23607476a008f0e20bf6c2daca9a3b","schema_version":"1.0","event_id":"sha256:3f9a04288be2613accb4842708c53028ad23607476a008f0e20bf6c2daca9a3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TNEXSKG4AYTLUXHR5DGDIEZO2Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of Edge Monitoring on Some Graph Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Fairouz Beggas, Guillaume Bagan, Hamamache Kheddouci, Mohammed Haddad","submitted_at":"2017-10-05T13:36:01Z","abstract_excerpt":"In this paper, we study the complexity of the edge monitoring problem. A vertex $v$ monitors an edge $e$ if both extremities together with $v$ form a triangle in the graph. Given a graph $G=(V,E)$ and a weight function on edges $c$ where $c(e)$ is the number of monitors that needs the edge $e$, the problem is to seek a minimum subset of monitors $S$ such that every edge $e$ in the graph is monitored by at least $c(e)$ vertices in $S$. In this paper, we study the edge monitoring problem on several graph classes such as complete graphs, block graphs, cographs, split graphs, interval graphs and p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02013","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"},"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:33:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QT9gNpQPDornn1JK1hs43DIgGjPRMS1GpdunwgnyZGN+vUBhvrzfiGuh2yLF6EHG4H+Thv8jW+0pninLXV4kDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:14:20.017134Z"},"content_sha256":"3dc9e03a526124302370488c25d29d2d2a254265407c049a610b88ec0ac63ced","schema_version":"1.0","event_id":"sha256:3dc9e03a526124302370488c25d29d2d2a254265407c049a610b88ec0ac63ced"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TNEXSKG4AYTLUXHR5DGDIEZO2Y/bundle.json","state_url":"https://pith.science/pith/TNEXSKG4AYTLUXHR5DGDIEZO2Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TNEXSKG4AYTLUXHR5DGDIEZO2Y/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-01T11:14:20Z","links":{"resolver":"https://pith.science/pith/TNEXSKG4AYTLUXHR5DGDIEZO2Y","bundle":"https://pith.science/pith/TNEXSKG4AYTLUXHR5DGDIEZO2Y/bundle.json","state":"https://pith.science/pith/TNEXSKG4AYTLUXHR5DGDIEZO2Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TNEXSKG4AYTLUXHR5DGDIEZO2Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TNEXSKG4AYTLUXHR5DGDIEZO2Y","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":"274f58e18027d1681b6b97c08e0ec2d4dbb66495f2489940feb201f2642f662a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-10-05T13:36:01Z","title_canon_sha256":"c7a758aea41487eab4073e69306da0b5827313e9507d1ab0242b83660c9545f2"},"schema_version":"1.0","source":{"id":"1710.02013","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02013","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02013v1","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02013","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"pith_short_12","alias_value":"TNEXSKG4AYTL","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TNEXSKG4AYTLUXHR","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TNEXSKG4","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:3dc9e03a526124302370488c25d29d2d2a254265407c049a610b88ec0ac63ced","target":"graph","created_at":"2026-05-18T00:33:37Z","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 this paper, we study the complexity of the edge monitoring problem. A vertex $v$ monitors an edge $e$ if both extremities together with $v$ form a triangle in the graph. Given a graph $G=(V,E)$ and a weight function on edges $c$ where $c(e)$ is the number of monitors that needs the edge $e$, the problem is to seek a minimum subset of monitors $S$ such that every edge $e$ in the graph is monitored by at least $c(e)$ vertices in $S$. In this paper, we study the edge monitoring problem on several graph classes such as complete graphs, block graphs, cographs, split graphs, interval graphs and p","authors_text":"Fairouz Beggas, Guillaume Bagan, Hamamache Kheddouci, Mohammed Haddad","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-10-05T13:36:01Z","title":"Complexity of Edge Monitoring on Some Graph Classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02013","kind":"arxiv","version":1},"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:3f9a04288be2613accb4842708c53028ad23607476a008f0e20bf6c2daca9a3b","target":"record","created_at":"2026-05-18T00:33:37Z","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":"274f58e18027d1681b6b97c08e0ec2d4dbb66495f2489940feb201f2642f662a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-10-05T13:36:01Z","title_canon_sha256":"c7a758aea41487eab4073e69306da0b5827313e9507d1ab0242b83660c9545f2"},"schema_version":"1.0","source":{"id":"1710.02013","kind":"arxiv","version":1}},"canonical_sha256":"9b497928dc0626ba5cf1e8cc34132ed626bb13093c199e3dbf51c74cf4dc1347","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b497928dc0626ba5cf1e8cc34132ed626bb13093c199e3dbf51c74cf4dc1347","first_computed_at":"2026-05-18T00:33:37.779029Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:37.779029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nk9hDWuDvpv2OjzOPFHOZPR6urlAk64Ysevucg67+n90JcSdLmq+oHOt8Y+h5BUfL2/32FVYO4TR5hiP8C+aBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:37.779726Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.02013","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f9a04288be2613accb4842708c53028ad23607476a008f0e20bf6c2daca9a3b","sha256:3dc9e03a526124302370488c25d29d2d2a254265407c049a610b88ec0ac63ced"],"state_sha256":"f169e3e874d0e1538e15f0d3143dc81b0d6c0c27615cf841905d2fcfbb7b9008"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VuwWa/gY+YNwiOZuajwTDS7GvmoLVI+UREdVvUVXxEAoG9qh/H36PeprtUrr6p10Zohij38ppwAUQSlEt/0aBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:14:20.019304Z","bundle_sha256":"d1ecf7e6dff55cbcab58475313e57d1f7ba31562d80290c8b29fcb11d72adf44"}}