{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TNEXSKG4AYTLUXHR5DGDIEZO2Y","short_pith_number":"pith:TNEXSKG4","schema_version":"1.0","canonical_sha256":"9b497928dc0626ba5cf1e8cc34132ed626bb13093c199e3dbf51c74cf4dc1347","source":{"kind":"arxiv","id":"1710.02013","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.02013","created_at":"2026-05-18T00:33:37.779151+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.02013v1","created_at":"2026-05-18T00:33:37.779151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02013","created_at":"2026-05-18T00:33:37.779151+00:00"},{"alias_kind":"pith_short_12","alias_value":"TNEXSKG4AYTL","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TNEXSKG4AYTLUXHR","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TNEXSKG4","created_at":"2026-05-18T12:31:46.661854+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/TNEXSKG4AYTLUXHR5DGDIEZO2Y","json":"https://pith.science/pith/TNEXSKG4AYTLUXHR5DGDIEZO2Y.json","graph_json":"https://pith.science/api/pith-number/TNEXSKG4AYTLUXHR5DGDIEZO2Y/graph.json","events_json":"https://pith.science/api/pith-number/TNEXSKG4AYTLUXHR5DGDIEZO2Y/events.json","paper":"https://pith.science/paper/TNEXSKG4"},"agent_actions":{"view_html":"https://pith.science/pith/TNEXSKG4AYTLUXHR5DGDIEZO2Y","download_json":"https://pith.science/pith/TNEXSKG4AYTLUXHR5DGDIEZO2Y.json","view_paper":"https://pith.science/paper/TNEXSKG4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.02013&json=true","fetch_graph":"https://pith.science/api/pith-number/TNEXSKG4AYTLUXHR5DGDIEZO2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/TNEXSKG4AYTLUXHR5DGDIEZO2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TNEXSKG4AYTLUXHR5DGDIEZO2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TNEXSKG4AYTLUXHR5DGDIEZO2Y/action/storage_attestation","attest_author":"https://pith.science/pith/TNEXSKG4AYTLUXHR5DGDIEZO2Y/action/author_attestation","sign_citation":"https://pith.science/pith/TNEXSKG4AYTLUXHR5DGDIEZO2Y/action/citation_signature","submit_replication":"https://pith.science/pith/TNEXSKG4AYTLUXHR5DGDIEZO2Y/action/replication_record"}},"created_at":"2026-05-18T00:33:37.779151+00:00","updated_at":"2026-05-18T00:33:37.779151+00:00"}