{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AKPF752PVAYSGMYOVX7MNE72CM","short_pith_number":"pith:AKPF752P","canonical_record":{"source":{"id":"1702.06112","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-20T18:53:37Z","cross_cats_sorted":[],"title_canon_sha256":"0a6ab3f22573337ffe270dfefe5a98ac7a086b26040761e87d8890a64a981429","abstract_canon_sha256":"2491f8077ae3f931cfd2ae926ed95d05385d99ef1a757b0a29267295284616de"},"schema_version":"1.0"},"canonical_sha256":"029e5ff74fa83123330eadfec693fa13294da5d67bc7dfd4de2a85d5feb63e13","source":{"kind":"arxiv","id":"1702.06112","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06112","created_at":"2026-05-17T23:42:54Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06112v2","created_at":"2026-05-17T23:42:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06112","created_at":"2026-05-17T23:42:54Z"},{"alias_kind":"pith_short_12","alias_value":"AKPF752PVAYS","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AKPF752PVAYSGMYO","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AKPF752P","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AKPF752PVAYSGMYOVX7MNE72CM","target":"record","payload":{"canonical_record":{"source":{"id":"1702.06112","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-20T18:53:37Z","cross_cats_sorted":[],"title_canon_sha256":"0a6ab3f22573337ffe270dfefe5a98ac7a086b26040761e87d8890a64a981429","abstract_canon_sha256":"2491f8077ae3f931cfd2ae926ed95d05385d99ef1a757b0a29267295284616de"},"schema_version":"1.0"},"canonical_sha256":"029e5ff74fa83123330eadfec693fa13294da5d67bc7dfd4de2a85d5feb63e13","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:54.017675Z","signature_b64":"7svb4Io+mWqmxmMaQWSRv2Lce221mfi/VUeXt8+q4L5mBanX9LlWa65Emr25fFDRKefmeRMxPGe5EgNaBUTHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"029e5ff74fa83123330eadfec693fa13294da5d67bc7dfd4de2a85d5feb63e13","last_reissued_at":"2026-05-17T23:42:54.017010Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:54.017010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.06112","source_version":2,"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-17T23:42:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tVyCQqz+FAXv7v0BM3grCr8cKO3bzMa9/D7cSFDiepGTthre24ydwIzVPwOnS4qBGii/2NNKGwQRwbah8UJoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:38:07.404910Z"},"content_sha256":"96b348d447af1223050331f17793014f45c43b7399331a4a872d5830ba4e31d0","schema_version":"1.0","event_id":"sha256:96b348d447af1223050331f17793014f45c43b7399331a4a872d5830ba4e31d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AKPF752PVAYSGMYOVX7MNE72CM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A general framework for path convexities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"F\\'abio Protti, Jo\\~ao Vinicius C. Thompson, Loana T. Nogueira, Mitre C. Dourado, Raquel S. F. Bravo, U\\'everton S. Souza","submitted_at":"2017-02-20T18:53:37Z","abstract_excerpt":"In this work we deal with the so-called path convexities, defined over special collections of paths. For example, the collection of the shortest paths in a graph is associated with the well-known geodesic convexity, while the collection of the induced paths is associated with the monophonic convexity; and there are many other examples. Besides reviewing the path convexities in the literature, we propose a general path convexity framework, of which most existing path convexities can be viewed as particular cases. Some benefits of the proposed framework are the systematization of the algorithmic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06112","kind":"arxiv","version":2},"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-17T23:42:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aDVNNBYPMjUZjngzIH2xEFS4oOsN5u0xAmO16XX3wQ5b3AAiBuWxVPDfKxN2ed+xOrD9mqu/wffCzRsQykGSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:38:07.405261Z"},"content_sha256":"6cecc1c4928e8eab0d86aae7430ddb33b10d3b60ac47665e319c1f3ecb97dd0c","schema_version":"1.0","event_id":"sha256:6cecc1c4928e8eab0d86aae7430ddb33b10d3b60ac47665e319c1f3ecb97dd0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AKPF752PVAYSGMYOVX7MNE72CM/bundle.json","state_url":"https://pith.science/pith/AKPF752PVAYSGMYOVX7MNE72CM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AKPF752PVAYSGMYOVX7MNE72CM/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-02T10:38:07Z","links":{"resolver":"https://pith.science/pith/AKPF752PVAYSGMYOVX7MNE72CM","bundle":"https://pith.science/pith/AKPF752PVAYSGMYOVX7MNE72CM/bundle.json","state":"https://pith.science/pith/AKPF752PVAYSGMYOVX7MNE72CM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AKPF752PVAYSGMYOVX7MNE72CM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AKPF752PVAYSGMYOVX7MNE72CM","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":"2491f8077ae3f931cfd2ae926ed95d05385d99ef1a757b0a29267295284616de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-20T18:53:37Z","title_canon_sha256":"0a6ab3f22573337ffe270dfefe5a98ac7a086b26040761e87d8890a64a981429"},"schema_version":"1.0","source":{"id":"1702.06112","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06112","created_at":"2026-05-17T23:42:54Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06112v2","created_at":"2026-05-17T23:42:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06112","created_at":"2026-05-17T23:42:54Z"},{"alias_kind":"pith_short_12","alias_value":"AKPF752PVAYS","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AKPF752PVAYSGMYO","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AKPF752P","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:6cecc1c4928e8eab0d86aae7430ddb33b10d3b60ac47665e319c1f3ecb97dd0c","target":"graph","created_at":"2026-05-17T23:42:54Z","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 work we deal with the so-called path convexities, defined over special collections of paths. For example, the collection of the shortest paths in a graph is associated with the well-known geodesic convexity, while the collection of the induced paths is associated with the monophonic convexity; and there are many other examples. Besides reviewing the path convexities in the literature, we propose a general path convexity framework, of which most existing path convexities can be viewed as particular cases. Some benefits of the proposed framework are the systematization of the algorithmic","authors_text":"F\\'abio Protti, Jo\\~ao Vinicius C. Thompson, Loana T. Nogueira, Mitre C. Dourado, Raquel S. F. Bravo, U\\'everton S. Souza","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-20T18:53:37Z","title":"A general framework for path convexities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06112","kind":"arxiv","version":2},"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:96b348d447af1223050331f17793014f45c43b7399331a4a872d5830ba4e31d0","target":"record","created_at":"2026-05-17T23:42:54Z","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":"2491f8077ae3f931cfd2ae926ed95d05385d99ef1a757b0a29267295284616de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-20T18:53:37Z","title_canon_sha256":"0a6ab3f22573337ffe270dfefe5a98ac7a086b26040761e87d8890a64a981429"},"schema_version":"1.0","source":{"id":"1702.06112","kind":"arxiv","version":2}},"canonical_sha256":"029e5ff74fa83123330eadfec693fa13294da5d67bc7dfd4de2a85d5feb63e13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"029e5ff74fa83123330eadfec693fa13294da5d67bc7dfd4de2a85d5feb63e13","first_computed_at":"2026-05-17T23:42:54.017010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:54.017010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7svb4Io+mWqmxmMaQWSRv2Lce221mfi/VUeXt8+q4L5mBanX9LlWa65Emr25fFDRKefmeRMxPGe5EgNaBUTHCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:54.017675Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06112","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96b348d447af1223050331f17793014f45c43b7399331a4a872d5830ba4e31d0","sha256:6cecc1c4928e8eab0d86aae7430ddb33b10d3b60ac47665e319c1f3ecb97dd0c"],"state_sha256":"dcfe68113c541cd5fa5bbd5c25eabc8aa853af139ca1667142fa7ab7526cdac0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wvfUhvTVKpyj3yPcMj1TfwTh7omtvDc5vKs3lu6T1W8D4JjPLnUgRXnMcJJyuoG9lwnbQPC4zwyqLec0bKKjDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:38:07.407273Z","bundle_sha256":"a20d86959b441ec71c1ae02d6c8106034716d3248c97d3549f0a33b155e7bdb6"}}