{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:2SSQPSQILGSS3GQ4U46GIVJSCJ","short_pith_number":"pith:2SSQPSQI","canonical_record":{"source":{"id":"2210.03774","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-10-07T18:43:33Z","cross_cats_sorted":[],"title_canon_sha256":"5c3f692ae97db52dfd523d793f890861042d35fca641bf315154ec664fbea3ba","abstract_canon_sha256":"2741656177570c0c0f78d466fe064299e58f85fe0f7215a8a07a4c3ca3096682"},"schema_version":"1.0"},"canonical_sha256":"d4a507ca0859a52d9a1ca73c6455321268d51712130f455fdefa0a9f1aee831c","source":{"kind":"arxiv","id":"2210.03774","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.03774","created_at":"2026-07-05T12:01:51Z"},{"alias_kind":"arxiv_version","alias_value":"2210.03774v3","created_at":"2026-07-05T12:01:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.03774","created_at":"2026-07-05T12:01:51Z"},{"alias_kind":"pith_short_12","alias_value":"2SSQPSQILGSS","created_at":"2026-07-05T12:01:51Z"},{"alias_kind":"pith_short_16","alias_value":"2SSQPSQILGSS3GQ4","created_at":"2026-07-05T12:01:51Z"},{"alias_kind":"pith_short_8","alias_value":"2SSQPSQI","created_at":"2026-07-05T12:01:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:2SSQPSQILGSS3GQ4U46GIVJSCJ","target":"record","payload":{"canonical_record":{"source":{"id":"2210.03774","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-10-07T18:43:33Z","cross_cats_sorted":[],"title_canon_sha256":"5c3f692ae97db52dfd523d793f890861042d35fca641bf315154ec664fbea3ba","abstract_canon_sha256":"2741656177570c0c0f78d466fe064299e58f85fe0f7215a8a07a4c3ca3096682"},"schema_version":"1.0"},"canonical_sha256":"d4a507ca0859a52d9a1ca73c6455321268d51712130f455fdefa0a9f1aee831c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:01:51.759158Z","signature_b64":"bSlLuKMeSDuwpSgbvZ8BhdOuuasTl+fK/bexGyw5gTisdLuAvabKztZt/oL/jrmR+TmbktQUmjR+S98YbosICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4a507ca0859a52d9a1ca73c6455321268d51712130f455fdefa0a9f1aee831c","last_reissued_at":"2026-07-05T12:01:51.758433Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:01:51.758433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.03774","source_version":3,"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-05T12:01:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z/NFawzzQbDXKIhv7RoKjrl0Qo+FA06D/5jWx7l/iCYpnro+rD+EKk2FDqX9SC1zXcF/eoT2FmPaRH6P7cq6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T02:48:22.537551Z"},"content_sha256":"3ce0831c377ffa0d49d703dcc531ff5a8c742f29add62b1ebbd47d4e6d80a58c","schema_version":"1.0","event_id":"sha256:3ce0831c377ffa0d49d703dcc531ff5a8c742f29add62b1ebbd47d4e6d80a58c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:2SSQPSQILGSS3GQ4U46GIVJSCJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Monitoring edge-geodetic sets in graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Florent Foucaud, Krishna Narayanan, Lekshmi Ramasubramony Sulochana, Sanjana Dey, Subhadeep R. Dev","submitted_at":"2022-10-07T18:43:33Z","abstract_excerpt":"We introduce a new graph-theoretic concept in the area of network monitoring. In this area, one wishes to monitor the vertices and/or the edges of a network (viewed as a graph) in order to detect and prevent failures. Inspired by two notions studied in the literature (edge-geodetic sets and distance-edge-monitoring sets), we define the notion of a monitoring edge-geodetic set (MEG-set for short) of a graph $G$ as an edge-geodetic set $S\\subseteq V(G)$ of $G$ (that is, every edge of $G$ lies on some shortest path between two vertices of $S$) with the additional property that for every edge $e$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.03774","kind":"arxiv","version":3},"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/2210.03774/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-05T12:01:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2TxEgMAVlLntfu2GgaOvrs8Xc0n6YZBefYu34e61sdO6GvjVzV85pcOx4PgYj+aHpEtSv25TJmg5M15A0DvaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T02:48:22.537938Z"},"content_sha256":"890eebe42a58b048f30df4a838cbfc633a3fcb0135b6401938b4b5482e1dc519","schema_version":"1.0","event_id":"sha256:890eebe42a58b048f30df4a838cbfc633a3fcb0135b6401938b4b5482e1dc519"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2SSQPSQILGSS3GQ4U46GIVJSCJ/bundle.json","state_url":"https://pith.science/pith/2SSQPSQILGSS3GQ4U46GIVJSCJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2SSQPSQILGSS3GQ4U46GIVJSCJ/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-07-11T02:48:22Z","links":{"resolver":"https://pith.science/pith/2SSQPSQILGSS3GQ4U46GIVJSCJ","bundle":"https://pith.science/pith/2SSQPSQILGSS3GQ4U46GIVJSCJ/bundle.json","state":"https://pith.science/pith/2SSQPSQILGSS3GQ4U46GIVJSCJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2SSQPSQILGSS3GQ4U46GIVJSCJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:2SSQPSQILGSS3GQ4U46GIVJSCJ","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":"2741656177570c0c0f78d466fe064299e58f85fe0f7215a8a07a4c3ca3096682","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-10-07T18:43:33Z","title_canon_sha256":"5c3f692ae97db52dfd523d793f890861042d35fca641bf315154ec664fbea3ba"},"schema_version":"1.0","source":{"id":"2210.03774","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.03774","created_at":"2026-07-05T12:01:51Z"},{"alias_kind":"arxiv_version","alias_value":"2210.03774v3","created_at":"2026-07-05T12:01:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.03774","created_at":"2026-07-05T12:01:51Z"},{"alias_kind":"pith_short_12","alias_value":"2SSQPSQILGSS","created_at":"2026-07-05T12:01:51Z"},{"alias_kind":"pith_short_16","alias_value":"2SSQPSQILGSS3GQ4","created_at":"2026-07-05T12:01:51Z"},{"alias_kind":"pith_short_8","alias_value":"2SSQPSQI","created_at":"2026-07-05T12:01:51Z"}],"graph_snapshots":[{"event_id":"sha256:890eebe42a58b048f30df4a838cbfc633a3fcb0135b6401938b4b5482e1dc519","target":"graph","created_at":"2026-07-05T12:01:51Z","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/2210.03774/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce a new graph-theoretic concept in the area of network monitoring. In this area, one wishes to monitor the vertices and/or the edges of a network (viewed as a graph) in order to detect and prevent failures. Inspired by two notions studied in the literature (edge-geodetic sets and distance-edge-monitoring sets), we define the notion of a monitoring edge-geodetic set (MEG-set for short) of a graph $G$ as an edge-geodetic set $S\\subseteq V(G)$ of $G$ (that is, every edge of $G$ lies on some shortest path between two vertices of $S$) with the additional property that for every edge $e$ ","authors_text":"Florent Foucaud, Krishna Narayanan, Lekshmi Ramasubramony Sulochana, Sanjana Dey, Subhadeep R. Dev","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-10-07T18:43:33Z","title":"Monitoring edge-geodetic sets in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.03774","kind":"arxiv","version":3},"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:3ce0831c377ffa0d49d703dcc531ff5a8c742f29add62b1ebbd47d4e6d80a58c","target":"record","created_at":"2026-07-05T12:01:51Z","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":"2741656177570c0c0f78d466fe064299e58f85fe0f7215a8a07a4c3ca3096682","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-10-07T18:43:33Z","title_canon_sha256":"5c3f692ae97db52dfd523d793f890861042d35fca641bf315154ec664fbea3ba"},"schema_version":"1.0","source":{"id":"2210.03774","kind":"arxiv","version":3}},"canonical_sha256":"d4a507ca0859a52d9a1ca73c6455321268d51712130f455fdefa0a9f1aee831c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4a507ca0859a52d9a1ca73c6455321268d51712130f455fdefa0a9f1aee831c","first_computed_at":"2026-07-05T12:01:51.758433Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:01:51.758433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bSlLuKMeSDuwpSgbvZ8BhdOuuasTl+fK/bexGyw5gTisdLuAvabKztZt/oL/jrmR+TmbktQUmjR+S98YbosICw==","signature_status":"signed_v1","signed_at":"2026-07-05T12:01:51.759158Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.03774","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ce0831c377ffa0d49d703dcc531ff5a8c742f29add62b1ebbd47d4e6d80a58c","sha256:890eebe42a58b048f30df4a838cbfc633a3fcb0135b6401938b4b5482e1dc519"],"state_sha256":"57ab614ea93a4fb3c5c93d8f6c95b0f19d556f84ba3f48f1b2f4b007b22a9198"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TCGWo2XOjDzI+8fTkMWWW71qZUN+QbVWzh4kNpQTMjQZ90jXlBki6J8eTLiI9/yB6rELRO3gOEU5Sa1eqdc5AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-11T02:48:22.540852Z","bundle_sha256":"c9d088c12d0339f990a80788bdd335fdbc71186dbe2d7d0677f60e2f4d874288"}}