{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:RC2VHMW2GSEQK6PKO4EEYICWAR","short_pith_number":"pith:RC2VHMW2","canonical_record":{"source":{"id":"2501.14554","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-24T14:57:02Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"be92a0dbdbae0e4474d5188c1623e2d52fce2b11a3849e95d489154857b77561","abstract_canon_sha256":"c13cb85faa9e924a4a51fb297ca3c9ec82b5e4e4d8ad83955ad9d0a505c86294"},"schema_version":"1.0"},"canonical_sha256":"88b553b2da34890579ea77084c2056046890db9abe4fbfa4b6d55b84918e844a","source":{"kind":"arxiv","id":"2501.14554","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.14554","created_at":"2026-07-05T11:44:44Z"},{"alias_kind":"arxiv_version","alias_value":"2501.14554v2","created_at":"2026-07-05T11:44:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.14554","created_at":"2026-07-05T11:44:44Z"},{"alias_kind":"pith_short_12","alias_value":"RC2VHMW2GSEQ","created_at":"2026-07-05T11:44:44Z"},{"alias_kind":"pith_short_16","alias_value":"RC2VHMW2GSEQK6PK","created_at":"2026-07-05T11:44:44Z"},{"alias_kind":"pith_short_8","alias_value":"RC2VHMW2","created_at":"2026-07-05T11:44:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:RC2VHMW2GSEQK6PKO4EEYICWAR","target":"record","payload":{"canonical_record":{"source":{"id":"2501.14554","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-24T14:57:02Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"be92a0dbdbae0e4474d5188c1623e2d52fce2b11a3849e95d489154857b77561","abstract_canon_sha256":"c13cb85faa9e924a4a51fb297ca3c9ec82b5e4e4d8ad83955ad9d0a505c86294"},"schema_version":"1.0"},"canonical_sha256":"88b553b2da34890579ea77084c2056046890db9abe4fbfa4b6d55b84918e844a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:44.494392Z","signature_b64":"e9N3CA/iodec7WmnR1pPROJRfvRSjo2ECnuF3RWXEnADSDisT5zbW6lQkfLtkv14R78JC3CzkFXXdTVapdpWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88b553b2da34890579ea77084c2056046890db9abe4fbfa4b6d55b84918e844a","last_reissued_at":"2026-07-05T11:44:44.493961Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:44.493961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.14554","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-07-05T11:44:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"euHjYfaNRFDnZZRc07gkxB1MelojiIk0r2DbHysqtvTZfCEkyLYM2xIsryjV+NgSLL+VkLVE+DOrQnU9qOS0Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:41:05.726815Z"},"content_sha256":"18fe46e39d2172cade521b55a57bd38c12da590cfca0088c271ec29d221a3129","schema_version":"1.0","event_id":"sha256:18fe46e39d2172cade521b55a57bd38c12da590cfca0088c271ec29d221a3129"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:RC2VHMW2GSEQK6PKO4EEYICWAR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alexander Grigoriev, Katherine Faulkner","submitted_at":"2025-01-24T14:57:02Z","abstract_excerpt":"Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set, Vertex Cover, Chromatic Number and Treewidth problems on, so-called, continuous or metric graphs where every edge is represented by a unit-length continuous interval rather than by a pair of vertices. If any point of any unit-interval edge is considered as a possible member of a hitting set or a cover, the classical combinatorial problems become trickier and many"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.14554","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.14554/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-05T11:44:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TydXsQHQzHik9hlQTXRmDDOZwmEYx0uQu5cvTVeQr9VIG7xzuv1I7YyWGAuYkZASaVEg3YNv6HWR154V4tyVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:41:05.727173Z"},"content_sha256":"a2942148a56553538e957ec399666ab1507031014b15ae38243f0532f105b4e1","schema_version":"1.0","event_id":"sha256:a2942148a56553538e957ec399666ab1507031014b15ae38243f0532f105b4e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RC2VHMW2GSEQK6PKO4EEYICWAR/bundle.json","state_url":"https://pith.science/pith/RC2VHMW2GSEQK6PKO4EEYICWAR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RC2VHMW2GSEQK6PKO4EEYICWAR/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-14T06:41:05Z","links":{"resolver":"https://pith.science/pith/RC2VHMW2GSEQK6PKO4EEYICWAR","bundle":"https://pith.science/pith/RC2VHMW2GSEQK6PKO4EEYICWAR/bundle.json","state":"https://pith.science/pith/RC2VHMW2GSEQK6PKO4EEYICWAR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RC2VHMW2GSEQK6PKO4EEYICWAR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RC2VHMW2GSEQK6PKO4EEYICWAR","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":"c13cb85faa9e924a4a51fb297ca3c9ec82b5e4e4d8ad83955ad9d0a505c86294","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-24T14:57:02Z","title_canon_sha256":"be92a0dbdbae0e4474d5188c1623e2d52fce2b11a3849e95d489154857b77561"},"schema_version":"1.0","source":{"id":"2501.14554","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.14554","created_at":"2026-07-05T11:44:44Z"},{"alias_kind":"arxiv_version","alias_value":"2501.14554v2","created_at":"2026-07-05T11:44:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.14554","created_at":"2026-07-05T11:44:44Z"},{"alias_kind":"pith_short_12","alias_value":"RC2VHMW2GSEQ","created_at":"2026-07-05T11:44:44Z"},{"alias_kind":"pith_short_16","alias_value":"RC2VHMW2GSEQK6PK","created_at":"2026-07-05T11:44:44Z"},{"alias_kind":"pith_short_8","alias_value":"RC2VHMW2","created_at":"2026-07-05T11:44:44Z"}],"graph_snapshots":[{"event_id":"sha256:a2942148a56553538e957ec399666ab1507031014b15ae38243f0532f105b4e1","target":"graph","created_at":"2026-07-05T11:44:44Z","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/2501.14554/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set, Vertex Cover, Chromatic Number and Treewidth problems on, so-called, continuous or metric graphs where every edge is represented by a unit-length continuous interval rather than by a pair of vertices. If any point of any unit-interval edge is considered as a possible member of a hitting set or a cover, the classical combinatorial problems become trickier and many","authors_text":"Alexander Grigoriev, Katherine Faulkner","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-24T14:57:02Z","title":"Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.14554","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:18fe46e39d2172cade521b55a57bd38c12da590cfca0088c271ec29d221a3129","target":"record","created_at":"2026-07-05T11:44:44Z","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":"c13cb85faa9e924a4a51fb297ca3c9ec82b5e4e4d8ad83955ad9d0a505c86294","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-24T14:57:02Z","title_canon_sha256":"be92a0dbdbae0e4474d5188c1623e2d52fce2b11a3849e95d489154857b77561"},"schema_version":"1.0","source":{"id":"2501.14554","kind":"arxiv","version":2}},"canonical_sha256":"88b553b2da34890579ea77084c2056046890db9abe4fbfa4b6d55b84918e844a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88b553b2da34890579ea77084c2056046890db9abe4fbfa4b6d55b84918e844a","first_computed_at":"2026-07-05T11:44:44.493961Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:44:44.493961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e9N3CA/iodec7WmnR1pPROJRfvRSjo2ECnuF3RWXEnADSDisT5zbW6lQkfLtkv14R78JC3CzkFXXdTVapdpWBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:44:44.494392Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.14554","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18fe46e39d2172cade521b55a57bd38c12da590cfca0088c271ec29d221a3129","sha256:a2942148a56553538e957ec399666ab1507031014b15ae38243f0532f105b4e1"],"state_sha256":"e40b1007fbfc2bd4436b39573e3d48be9cd3d20026a985360e9964a138f874c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qf873Qp2muJa3j34xO7e4JOGW8uYTVVlJEHvcCxEXrGRzVrXfDXJ4BfZPZSPT71XoGzQQoy+K4T0kEcNeLB2Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T06:41:05.729604Z","bundle_sha256":"8e7d5ab2163132283f711b225ecf799d19d9d32cacf5d0a319fea0ee47bdd2b1"}}