{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HTG3GSAMA6B3RI53JLOEMO62VK","short_pith_number":"pith:HTG3GSAM","canonical_record":{"source":{"id":"2607.09170","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-10T07:57:15Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"ad4d31a41716301cea813aed94d52e4affe9f842befc37698d25c79bfdb5b11a","abstract_canon_sha256":"a50521cdc453c0feecf8c9ad6cff2fb21f2a930afd025778ca460186c766b27a"},"schema_version":"1.0"},"canonical_sha256":"3ccdb3480c0783b8a3bb4adc463bdaaaa140c38882c8be323ca40a6ff3e125eb","source":{"kind":"arxiv","id":"2607.09170","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.09170","created_at":"2026-07-13T01:18:48Z"},{"alias_kind":"arxiv_version","alias_value":"2607.09170v1","created_at":"2026-07-13T01:18:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.09170","created_at":"2026-07-13T01:18:48Z"},{"alias_kind":"pith_short_12","alias_value":"HTG3GSAMA6B3","created_at":"2026-07-13T01:18:48Z"},{"alias_kind":"pith_short_16","alias_value":"HTG3GSAMA6B3RI53","created_at":"2026-07-13T01:18:48Z"},{"alias_kind":"pith_short_8","alias_value":"HTG3GSAM","created_at":"2026-07-13T01:18:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HTG3GSAMA6B3RI53JLOEMO62VK","target":"record","payload":{"canonical_record":{"source":{"id":"2607.09170","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-10T07:57:15Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"ad4d31a41716301cea813aed94d52e4affe9f842befc37698d25c79bfdb5b11a","abstract_canon_sha256":"a50521cdc453c0feecf8c9ad6cff2fb21f2a930afd025778ca460186c766b27a"},"schema_version":"1.0"},"canonical_sha256":"3ccdb3480c0783b8a3bb4adc463bdaaaa140c38882c8be323ca40a6ff3e125eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-13T01:18:48.272901Z","signature_b64":"cwsy5OTcW23LCuCQr2Sc6G6sj+9NddezU6A/wOJwT88stZY0NrRnDnwXru2n7TaurS43WVUw6+wHtoh5SWuSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ccdb3480c0783b8a3bb4adc463bdaaaa140c38882c8be323ca40a6ff3e125eb","last_reissued_at":"2026-07-13T01:18:48.271385Z","signature_status":"signed_v1","first_computed_at":"2026-07-13T01:18:48.271385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.09170","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-07-13T01:18:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dT2yz+MoCbawAlMudQk4okmS3apCJF5oA+MJ+55bB9VQkyrGTqEkglYVFxisukMATqg8ZZMC7aamEFkmygZ/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T23:20:31.581072Z"},"content_sha256":"b8cf3c9c376b30f1b0d2901dfb8359457a8af707cb9b837411d5e99c421ca749","schema_version":"1.0","event_id":"sha256:b8cf3c9c376b30f1b0d2901dfb8359457a8af707cb9b837411d5e99c421ca749"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HTG3GSAMA6B3RI53JLOEMO62VK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DC","authors_text":"George Skretas, Janosch Ruff, Sonia Simons, Yannic Maus","submitted_at":"2026-07-10T07:57:15Z","abstract_excerpt":"Real-world networks like the internet share patterns like a power law degree distribution and a high clustering coefficient. Many of these properties are captured by the generative model of hyperbolic random graphs (HRGs), which provides a theoretical framework for studying such networks. Motivated by the observation that several algorithms perform better on real-world networks than their worst-case guarantees suggest, we design and analyse distributed algorithms under the assumption that the input graph is an HRG. Indeed, prior work has shown that the classical symmetry-breaking problem of $\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.09170","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.09170/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-13T01:18:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dDYXBhJIXCgnL00xGDZkVjp7up+Oc4RQGi/0j3d6fgSnNx+HnrN9TRM1YjjAqOvgidXBJskxz1t/EMsmVG2bAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T23:20:31.582356Z"},"content_sha256":"0eb8c65162a90d15caf141acd929c57b7689b943a9f0103cff02bfc2adc5492b","schema_version":"1.0","event_id":"sha256:0eb8c65162a90d15caf141acd929c57b7689b943a9f0103cff02bfc2adc5492b"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:HTG3GSAMA6B3RI53JLOEMO62VK","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1145/2742012.url:https://doi.org/10.1145/2742012) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer. “Local Computation: Lower and Upper Bounds”. In:J. ACM(2016).doi: 10.1145/2742012.url: https://doi.org/10.1145/2742012","arxiv_id":"2607.09170","detector":"doi_compliance","evidence":{"ref_index":69,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer. “Local Computation: Lower and Upper Bounds”. In:J. ACM(2016).doi: 10.1145/2742012.url: https://doi.org/10.1145/2742012","reconstructed_doi":"10.1145/2742012.url:https://doi.org/10.1145/2742012"},"severity":"advisory","ref_index":69,"audited_at":"2026-07-13T05:03:48.330044Z","event_type":"pith.integrity.v1","detected_doi":"10.1145/2742012.url:https://doi.org/10.1145/2742012","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"25b9f4c831d00292a916f271df838c8361a90f4d387106210e262c3f724209cd","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":12912,"payload_sha256":"f19f2591719902453ba8f30d56fd8dffed7701275cf033db1fad9f9634ee3279","signature_b64":"2XyZ0K1Wm2bclFM3UEBfcpqZWEqSPrq8yYcGfBtrze+8qD4ku7FJAiez5nj3GRMnhlDPcXNchHabyS57u+fkCg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-13T05:03:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jMqUaTyNLE7H0eYcq7ODqGnXFRD7TYcTHJx5n2KukjaHNSCq5AED+FV87gr7UVlebHhNGVddzIBi3KM29vziAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T23:20:31.596909Z"},"content_sha256":"fbb59a3e2eec5c0df75ae0f1e6b4cda050ed153fe3363f59c85dcfb250f00bac","schema_version":"1.0","event_id":"sha256:fbb59a3e2eec5c0df75ae0f1e6b4cda050ed153fe3363f59c85dcfb250f00bac"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:HTG3GSAMA6B3RI53JLOEMO62VK","target":"integrity","payload":{"note":"Identifier '10.1214/24-ejp1216.url:http://dx.doi.org/10.1214/24-ejp1216' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Júlia Komjáthy, John Lapinskas, Johannes Lengler, and Ulysse Schaller. “Polynomial growth in degree- dependent first passage percolation on spatial random graphs”. In:Electronic Journal of Probability (2024).doi:10.1214/24-ejp1216.url:http:","arxiv_id":"2607.09170","detector":"doi_compliance","evidence":{"doi":"10.1214/24-ejp1216.url:http://dx.doi.org/10.1214/24-ejp1216","arxiv_id":null,"ref_index":63,"raw_excerpt":"Júlia Komjáthy, John Lapinskas, Johannes Lengler, and Ulysse Schaller. “Polynomial growth in degree- dependent first passage percolation on spatial random graphs”. In:Electronic Journal of Probability (2024).doi:10.1214/24-ejp1216.url:http://dx.doi.org/10.1214/24-EJP1216","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":63,"audited_at":"2026-07-13T05:03:48.330044Z","event_type":"pith.integrity.v1","detected_doi":"10.1214/24-ejp1216.url:http://dx.doi.org/10.1214/24-ejp1216","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"f1a42905dab38b63b23c38d5aa162d6faa007ddca4df6f9ff36e36b5c7630203","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":12911,"payload_sha256":"3ea2ecea098a4c90f9da7c6716558a69db773a20887ce23c3ddb8e0ecfdfe019","signature_b64":"FbXQR9LNk2O5r32AfipT50hlx1IHlQWa5nwpKgChsGzgovGVEKry9ghu+rW8BRiQlZ0bKrecHFSM7NkaHoQdCA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-13T05:03:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l5vksZloj0l2mlfVyeQ9IkNrm1oSiYAg4pieK2X+XVcZ4As/hgZtHJ+wFTgNL3pcxeNIb5XTbxmCZyuDsz4nBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T23:20:31.597628Z"},"content_sha256":"a904133bdb9b349cd3a3ce427c0e2787f7438068b3c5a0e7e3fc6ae5aa7c38ed","schema_version":"1.0","event_id":"sha256:a904133bdb9b349cd3a3ce427c0e2787f7438068b3c5a0e7e3fc6ae5aa7c38ed"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:HTG3GSAMA6B3RI53JLOEMO62VK","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1137/1.9781611978971.226.url:https://doi) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Marc Kaufmann, Kostas Lakis, Johannes Lengler, Raghu Raman Ravi, Ulysse Schaller, and Konstantin Sturm. “Rumour Spreading Depends on the Latent Geometry and Degree Distribution in Social Network Models”. In:SODA’26. 2026.doi: 10.1137/1.9781","arxiv_id":"2607.09170","detector":"doi_compliance","evidence":{"ref_index":55,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Marc Kaufmann, Kostas Lakis, Johannes Lengler, Raghu Raman Ravi, Ulysse Schaller, and Konstantin Sturm. “Rumour Spreading Depends on the Latent Geometry and Degree Distribution in Social Network Models”. In:SODA’26. 2026.doi: 10.1137/1.9781","reconstructed_doi":"10.1137/1.9781611978971.226.url:https://doi"},"severity":"advisory","ref_index":55,"audited_at":"2026-07-13T05:03:48.330044Z","event_type":"pith.integrity.v1","detected_doi":"10.1137/1.9781611978971.226.url:https://doi","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"0039299547b3449bfa5cfae081af29e1fccbf5bd46058083813fde0772e09630","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":12910,"payload_sha256":"2275e7bf81d19f413438146f5d4952fd1215d2bc937cb623ae0de534a054fac9","signature_b64":"NhuTMM5ekGZcIh+GqLYmeHyge9WX32T0hX6q7hz/kEOgpIJQlqXhF00MofY0SNvjgNic0p6XKxgawYwkm6e5BQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-13T05:03:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JQPWShYCrlAKwGnr1BwdI23USqLUwUqVCGym8if4bJEsZYNF+RuRiIVworgDKwjnSBQ42uQcfc9htZJRnc5eAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T23:20:31.598422Z"},"content_sha256":"191549950d48eb24fd09f76a32f35cfda65f87d79919f5479ec9e49e3670a528","schema_version":"1.0","event_id":"sha256:191549950d48eb24fd09f76a32f35cfda65f87d79919f5479ec9e49e3670a528"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:HTG3GSAMA6B3RI53JLOEMO62VK","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1137/1.9781611977554.ch97.url:https://epubs.siam.org/doi/abs/10) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, and Václav Rozhoň. “Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization”. In:SODA’23. 2023.doi: 10.1137/1.9781611977554.ch97.url: htt","arxiv_id":"2607.09170","detector":"doi_compliance","evidence":{"ref_index":48,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, and Václav Rozhoň. “Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization”. In:SODA’23. 2023.doi: 10.1137/1.9781611977554.ch97.url: htt","reconstructed_doi":"10.1137/1.9781611977554.ch97.url:https://epubs.siam.org/doi/abs/10"},"severity":"advisory","ref_index":48,"audited_at":"2026-07-13T05:03:48.330044Z","event_type":"pith.integrity.v1","detected_doi":"10.1137/1.9781611977554.ch97.url:https://epubs.siam.org/doi/abs/10","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"e3ac13cc1b837830a0379b26bc0d9add3b4fe6fc0f9ed94228a5edf592a49386","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":12909,"payload_sha256":"fff5bade67e17057a2f29481f859bf6280a039b0815f8d380a39b38b4d4742ab","signature_b64":"UPf6R4E8v917kTS0YGfxDdjGvLqw/y08lrK6B3mlfjqcre9w04W5GmNJBT7R1n+7sPz6BfvHT4/bS2pmZdD6AQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-13T05:03:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CORkgNGcI5hgAWpaNh+sAJ6jNS33IwGTriMryGtuGx0Yw4MrJ3sZW7Nz35uNSALRAJaMMwWkUIYwhJostHkNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T23:20:31.598953Z"},"content_sha256":"325257bd522f6d471bfa332eeb83ccc8129e278ac426fce6ecf4ff2c5a9fd862","schema_version":"1.0","event_id":"sha256:325257bd522f6d471bfa332eeb83ccc8129e278ac426fce6ecf4ff2c5a9fd862"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:HTG3GSAMA6B3RI53JLOEMO62VK","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1137/1.9781611975482.50.url:https://doi.org/10.1137/1.9781611975482) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Mohsen Ghaffari. “Distributed Maximal Independent Set using Small Messages”. In:SODA’19. 2019. doi: 10.1137/1.9781611975482.50.url: https://doi.org/10.1137/1.9781611975482. 50","arxiv_id":"2607.09170","detector":"doi_compliance","evidence":{"ref_index":45,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Mohsen Ghaffari. “Distributed Maximal Independent Set using Small Messages”. In:SODA’19. 2019. doi: 10.1137/1.9781611975482.50.url: https://doi.org/10.1137/1.9781611975482. 50","reconstructed_doi":"10.1137/1.9781611975482.50.url:https://doi.org/10.1137/1.9781611975482"},"severity":"advisory","ref_index":45,"audited_at":"2026-07-13T05:03:48.330044Z","event_type":"pith.integrity.v1","detected_doi":"10.1137/1.9781611975482.50.url:https://doi.org/10.1137/1.9781611975482","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"17b9e8bfe544116c315f04745722f9c4b3eb5e33d0f10ba5a7e5016fb469087f","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":12908,"payload_sha256":"7191e46a3c37fb63b923c1ef05f4d7db52d3751ff13244b5e80bb660f752e84b","signature_b64":"INAcD5fSY1qewgtON/RuDyy68OvPwD4EN9ppkC4Mw1JGxdkKZCwRx+Rye3VhOdpT606sIs3BnJTRL1CJbyLADw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-13T05:03:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/m88cxHUE/OJno8p3658SEB6CYlia3EI2O/qSq58SByQg8PSGT/irNjB4A+QZgpD6uJAOrXMChMqrY0mBvaHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T23:20:31.599519Z"},"content_sha256":"241c650e70b13096065a17cd7263a66cf059751160d78766e6a423d7b24c52c7","schema_version":"1.0","event_id":"sha256:241c650e70b13096065a17cd7263a66cf059751160d78766e6a423d7b24c52c7"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:HTG3GSAMA6B3RI53JLOEMO62VK","target":"integrity","payload":{"note":"Identifier '10.48550/arxiv.2410.22186.url:https://arxiv.org/abs/2410.22186' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Sacha Cerf, Benjamin Dayan, Umberto De Ambroggio, Marc Kaufmann, Johannes Lengler, and Ulysse Schaller. “Balanced Bidirectional Breadth-First Search on Scale-Free Networks”. In:arXiv(2024).doi: 10.48550/ARXIV.2410.22186.url:https://arxiv.or","arxiv_id":"2607.09170","detector":"doi_compliance","evidence":{"doi":"10.48550/arxiv.2410.22186.url:https://arxiv.org/abs/2410.22186","arxiv_id":null,"ref_index":33,"raw_excerpt":"Sacha Cerf, Benjamin Dayan, Umberto De Ambroggio, Marc Kaufmann, Johannes Lengler, and Ulysse Schaller. “Balanced Bidirectional Breadth-First Search on Scale-Free Networks”. In:arXiv(2024).doi: 10.48550/ARXIV.2410.22186.url:https://arxiv.org/abs/2410.22186","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":33,"audited_at":"2026-07-13T05:03:48.330044Z","event_type":"pith.integrity.v1","detected_doi":"10.48550/arxiv.2410.22186.url:https://arxiv.org/abs/2410.22186","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"32256ac8d90b03130498754b6ac5440e6669c14bb718434608f4e5314185a223","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":12907,"payload_sha256":"b9a7fc74968ee27d5c20a3f416edcf3bbcd1bd64aa2d5175a1f2bda49c0295e5","signature_b64":"Y30B5mQo6EzvVrZPu/Tv7a4IJJnm1HbOJ6O9y030XcO+wCm8j0Z6mHjnRrKg+tEsxsUKxns1qkJ8lZkFqxesAw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-13T05:03:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E5iQjntp51roYV3e6XHK+jhYX+v4Plfem/AgXygDKtvzp98cHanqhmiDGVAFeWpJQNlvjICzSI7nng1Vrh8iBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T23:20:31.599918Z"},"content_sha256":"5dd7e03b3280e0e5eec0dc4f8019d511cfadcc64a2a9cd1b1bc4503a7bfd11c5","schema_version":"1.0","event_id":"sha256:5dd7e03b3280e0e5eec0dc4f8019d511cfadcc64a2a9cd1b1bc4503a7bfd11c5"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:HTG3GSAMA6B3RI53JLOEMO62VK","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1145/3382734.3405745.url:https://doi.org/10) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Sebastian Brandt and Dennis Olivetti. “Truly Tight-in-ΔBounds for Bipartite Maximal Matching and Variants”. In:PODC’20. 2020.doi: 10.1145/3382734.3405745.url: https://doi.org/10. 1145/3382734.3405745","arxiv_id":"2607.09170","detector":"doi_compliance","evidence":{"ref_index":30,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Sebastian Brandt and Dennis Olivetti. “Truly Tight-in-ΔBounds for Bipartite Maximal Matching and Variants”. In:PODC’20. 2020.doi: 10.1145/3382734.3405745.url: https://doi.org/10. 1145/3382734.3405745","reconstructed_doi":"10.1145/3382734.3405745.url:https://doi.org/10"},"severity":"advisory","ref_index":30,"audited_at":"2026-07-13T05:03:48.330044Z","event_type":"pith.integrity.v1","detected_doi":"10.1145/3382734.3405745.url:https://doi.org/10","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"6370ceb79f48ea07f20ad41761dc589a0f02b1361b20680cc30d9658b1c87978","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":12906,"payload_sha256":"df5bba4677b699392191b004c80c74ee1bc1c1b59b3dbc8ea74af5d034b12e32","signature_b64":"V+EnHj/6uoZ6SwLKTDqgODCiGQKOCBNYXJ1nr2PQT0pAwe1BsPI5Wb3v1PDWVEuV1/XcD/cb3+RSrMk5kFiICA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-13T05:03:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ncOxljwqzcCC5/PRoTdGyAsLzEiGWHc8DO0zSTxXGenpOd8LtM2+KyTro0R2jsD8QaDeA6hCAjAMLd+LGGhNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T23:20:31.600289Z"},"content_sha256":"8198ce0bf5f8c50548ddaab944b5648596c712151d5eaaa7e5a5f269ee1e0a53","schema_version":"1.0","event_id":"sha256:8198ce0bf5f8c50548ddaab944b5648596c712151d5eaaa7e5a5f269ee1e0a53"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:HTG3GSAMA6B3RI53JLOEMO62VK","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1137/1.9781611978971.49.url:https://epubs.siam.org/doi/abs/10.1137/1.9781611978971.49) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Alkida Balliu, Filippo Casagrande, Francesco d’Amore, Massimo Equi, Barbara Keller, Henrik Lievo- nen, Dennis Olivetti, Gustav Schmid, and Jukka Suomela. “Distributed Quantum Advantage in Locally Checkable Labeling Problems”. In:SODA’26.doi","arxiv_id":"2607.09170","detector":"doi_compliance","evidence":{"ref_index":8,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Alkida Balliu, Filippo Casagrande, Francesco d’Amore, Massimo Equi, Barbara Keller, Henrik Lievo- nen, Dennis Olivetti, Gustav Schmid, and Jukka Suomela. “Distributed Quantum Advantage in Locally Checkable Labeling Problems”. In:SODA’26.doi","reconstructed_doi":"10.1137/1.9781611978971.49.url:https://epubs.siam.org/doi/abs/10.1137/1.9781611978971.49"},"severity":"advisory","ref_index":8,"audited_at":"2026-07-13T05:03:48.330044Z","event_type":"pith.integrity.v1","detected_doi":"10.1137/1.9781611978971.49.url:https://epubs.siam.org/doi/abs/10.1137/1.9781611978971.49","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"117339d1749735212b52cca6fbc961be87c8f158c95330ae312831c73e8f947c","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":12905,"payload_sha256":"c455c87c6ebba0da21cba323b05e044975116819ff682dc4f6e910106af40114","signature_b64":"RsQ+AEMX45WSO/iNJ/OjlrAyywDKjM5SYRKYuhfQNYKTh/wFzRGuQQmUjIquQlznxtkNpjH/hPFNApgiVxNDCA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-13T05:03:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nGuM7m6VaI2wCWHjgCwXSatMz1UeeJOdDXq3zxUGgTurp72ycs3ReIJIcAjnDN5JOOonXIBIXc3XUzoxTii9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T23:20:31.600661Z"},"content_sha256":"64de9bd8743cfa821cb1c743f6a8ba6c2670b78f4db383d415398e1a01ef149d","schema_version":"1.0","event_id":"sha256:64de9bd8743cfa821cb1c743f6a8ba6c2670b78f4db383d415398e1a01ef149d"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:HTG3GSAMA6B3RI53JLOEMO62VK","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1145/3519935.3520027.url:https://doi.org/) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Alkida Balliu, Sebastian Brandt, Fabian Kuhn, and Dennis Olivetti. “DistributedΔ-coloring plays hide-and-seek”. In:STOC’22. 2022.doi: 10.1145/3519935.3520027.url: https://doi.org/ 10.1145/3519935.3520027","arxiv_id":"2607.09170","detector":"doi_compliance","evidence":{"ref_index":6,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Alkida Balliu, Sebastian Brandt, Fabian Kuhn, and Dennis Olivetti. “DistributedΔ-coloring plays hide-and-seek”. In:STOC’22. 2022.doi: 10.1145/3519935.3520027.url: https://doi.org/ 10.1145/3519935.3520027","reconstructed_doi":"10.1145/3519935.3520027.url:https://doi.org/"},"severity":"advisory","ref_index":6,"audited_at":"2026-07-13T05:03:48.330044Z","event_type":"pith.integrity.v1","detected_doi":"10.1145/3519935.3520027.url:https://doi.org/","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"62264a626c331d600bdd0c85e9fd3f06660f4975da9fec784e8dfcaefda472dd","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":12904,"payload_sha256":"fd4ffacb52efa3c989fd0ebae227ba5ae673e04c847d02cdd82d1e255297b1be","signature_b64":"dKwFfoKd8MNdamIa9ZxCNWce7Zfq9zpPA9KUBD0jLAplctz0tG47j4f/mVK3O74FSJozf15vBg+SGLpd2tN9Dw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-13T05:03:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8WwCpZOP9/+yLckvMTnFKDcxTu8AbBuiHMUoUEDrp2ddN2HCSl8OaF47RaHzBOIrN53AKVfdp9F1q/bjTPUaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T23:20:31.601026Z"},"content_sha256":"f320728df320afc72fb96e8d8ee904ae6eb11536ed74bee459e4fae59013b29b","schema_version":"1.0","event_id":"sha256:f320728df320afc72fb96e8d8ee904ae6eb11536ed74bee459e4fae59013b29b"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:HTG3GSAMA6B3RI53JLOEMO62VK","target":"integrity","payload":{"note":"Identifier '10.1145/3461458.url:https://doi.org/10.1145/3461458' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, and Jukka Suomela. “Lower Bounds for Maximal Matchings and Maximal Independent Sets”. In:J. ACM(2021).doi: 10.1145/3461458.url:https://doi.org/10.1145/3461458","arxiv_id":"2607.09170","detector":"doi_compliance","evidence":{"doi":"10.1145/3461458.url:https://doi.org/10.1145/3461458","arxiv_id":null,"ref_index":5,"raw_excerpt":"Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, and Jukka Suomela. “Lower Bounds for Maximal Matchings and Maximal Independent Sets”. In:J. ACM(2021).doi: 10.1145/3461458.url:https://doi.org/10.1145/3461458","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":5,"audited_at":"2026-07-13T05:03:48.330044Z","event_type":"pith.integrity.v1","detected_doi":"10.1145/3461458.url:https://doi.org/10.1145/3461458","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"2b2118788ab77c92911bc53884b2e705a61830b27b1079c60a22c268504d8315","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":12903,"payload_sha256":"8eb8250af5bbbfa5921f35ed438110f617538e7b23674fd016899d3664f1f9d8","signature_b64":"zhfsvfccxW883E6M13fxkGW0nfolMTiXbBUnFra265KXED6v+LcudwPoocafIQq8lQWupy821ELw1X9tiZ/4DA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-13T05:03:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e3e8UeV4G+e7BYfoKYCNdEIJBpJNKXcICcxM4DTOMR7WH052az0YLb3C03oCHGAtqvsEZsInH8RE5yyIDXnTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T23:20:31.601409Z"},"content_sha256":"3047fa9680486422b4f7b5653af52b5fb10ec81733b24575df9735aa27447539","schema_version":"1.0","event_id":"sha256:3047fa9680486422b4f7b5653af52b5fb10ec81733b24575df9735aa27447539"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:HTG3GSAMA6B3RI53JLOEMO62VK","target":"integrity","payload":{"note":"Identifier '10.1016/0196-6774(86' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Noga Alon, László Babai, and Alon Itai. “A fast and simple randomized parallel algorithm for the maximal independent set problem”. In:Journal of Algorithms(1986).doi: 10.1016/0196-6774(86) 90019-2.url:http://dx.doi.org/10.1016/0196-6774(86)","arxiv_id":"2607.09170","detector":"doi_compliance","evidence":{"doi":"10.1016/0196-6774(86","arxiv_id":null,"ref_index":2,"raw_excerpt":"Noga Alon, László Babai, and Alon Itai. “A fast and simple randomized parallel algorithm for the maximal independent set problem”. In:Journal of Algorithms(1986).doi: 10.1016/0196-6774(86) 90019-2.url:http://dx.doi.org/10.1016/0196-6774(86)90019-2","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":2,"audited_at":"2026-07-13T05:03:48.330044Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/0196-6774(86","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"d568cbce4416a09832f7aca0a68b79bb1f168a178e6605405185902384839ded","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":12902,"payload_sha256":"3f17d8bbf3c838b7ea1893158bc0f795bd34ea4d66fb82f3f4c2f3f5743f665c","signature_b64":"DE2vWCyWkOXk15+EMzi2KDP3+caTExDd3jJrvHw/8bniC/8eAd6kIW6CIW4R/7kzP26EIWKhZ8sqyE4gprKZDw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-13T05:03:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wt7vYNOusJO0IrH9DOAkBZtwURjl5VVsvmbEgkJUqDGmOJrOVa7G+7EidxFq+k2vQ2Q2VGfFlpF9B+LoJZBpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T23:20:31.601879Z"},"content_sha256":"c749e351f8b2d4c62a88b2393989e2daafc7020322f5ec48626a01ce7d9fe908","schema_version":"1.0","event_id":"sha256:c749e351f8b2d4c62a88b2393989e2daafc7020322f5ec48626a01ce7d9fe908"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HTG3GSAMA6B3RI53JLOEMO62VK/bundle.json","state_url":"https://pith.science/pith/HTG3GSAMA6B3RI53JLOEMO62VK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HTG3GSAMA6B3RI53JLOEMO62VK/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-13T23:20:31Z","links":{"resolver":"https://pith.science/pith/HTG3GSAMA6B3RI53JLOEMO62VK","bundle":"https://pith.science/pith/HTG3GSAMA6B3RI53JLOEMO62VK/bundle.json","state":"https://pith.science/pith/HTG3GSAMA6B3RI53JLOEMO62VK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HTG3GSAMA6B3RI53JLOEMO62VK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HTG3GSAMA6B3RI53JLOEMO62VK","merge_version":"pith-open-graph-merge-v1","event_count":13,"valid_event_count":13,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a50521cdc453c0feecf8c9ad6cff2fb21f2a930afd025778ca460186c766b27a","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-10T07:57:15Z","title_canon_sha256":"ad4d31a41716301cea813aed94d52e4affe9f842befc37698d25c79bfdb5b11a"},"schema_version":"1.0","source":{"id":"2607.09170","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.09170","created_at":"2026-07-13T01:18:48Z"},{"alias_kind":"arxiv_version","alias_value":"2607.09170v1","created_at":"2026-07-13T01:18:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.09170","created_at":"2026-07-13T01:18:48Z"},{"alias_kind":"pith_short_12","alias_value":"HTG3GSAMA6B3","created_at":"2026-07-13T01:18:48Z"},{"alias_kind":"pith_short_16","alias_value":"HTG3GSAMA6B3RI53","created_at":"2026-07-13T01:18:48Z"},{"alias_kind":"pith_short_8","alias_value":"HTG3GSAM","created_at":"2026-07-13T01:18:48Z"}],"graph_snapshots":[{"event_id":"sha256:0eb8c65162a90d15caf141acd929c57b7689b943a9f0103cff02bfc2adc5492b","target":"graph","created_at":"2026-07-13T01:18:48Z","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/2607.09170/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Real-world networks like the internet share patterns like a power law degree distribution and a high clustering coefficient. Many of these properties are captured by the generative model of hyperbolic random graphs (HRGs), which provides a theoretical framework for studying such networks. Motivated by the observation that several algorithms perform better on real-world networks than their worst-case guarantees suggest, we design and analyse distributed algorithms under the assumption that the input graph is an HRG. Indeed, prior work has shown that the classical symmetry-breaking problem of $\\","authors_text":"George Skretas, Janosch Ruff, Sonia Simons, Yannic Maus","cross_cats":["math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.09170","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:b8cf3c9c376b30f1b0d2901dfb8359457a8af707cb9b837411d5e99c421ca749","target":"record","created_at":"2026-07-13T01:18:48Z","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":"a50521cdc453c0feecf8c9ad6cff2fb21f2a930afd025778ca460186c766b27a","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-10T07:57:15Z","title_canon_sha256":"ad4d31a41716301cea813aed94d52e4affe9f842befc37698d25c79bfdb5b11a"},"schema_version":"1.0","source":{"id":"2607.09170","kind":"arxiv","version":1}},"canonical_sha256":"3ccdb3480c0783b8a3bb4adc463bdaaaa140c38882c8be323ca40a6ff3e125eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ccdb3480c0783b8a3bb4adc463bdaaaa140c38882c8be323ca40a6ff3e125eb","first_computed_at":"2026-07-13T01:18:48.271385Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-13T01:18:48.271385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cwsy5OTcW23LCuCQr2Sc6G6sj+9NddezU6A/wOJwT88stZY0NrRnDnwXru2n7TaurS43WVUw6+wHtoh5SWuSBw==","signature_status":"signed_v1","signed_at":"2026-07-13T01:18:48.272901Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.09170","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:191549950d48eb24fd09f76a32f35cfda65f87d79919f5479ec9e49e3670a528","sha256:241c650e70b13096065a17cd7263a66cf059751160d78766e6a423d7b24c52c7","sha256:3047fa9680486422b4f7b5653af52b5fb10ec81733b24575df9735aa27447539","sha256:325257bd522f6d471bfa332eeb83ccc8129e278ac426fce6ecf4ff2c5a9fd862","sha256:5dd7e03b3280e0e5eec0dc4f8019d511cfadcc64a2a9cd1b1bc4503a7bfd11c5","sha256:64de9bd8743cfa821cb1c743f6a8ba6c2670b78f4db383d415398e1a01ef149d","sha256:8198ce0bf5f8c50548ddaab944b5648596c712151d5eaaa7e5a5f269ee1e0a53","sha256:a904133bdb9b349cd3a3ce427c0e2787f7438068b3c5a0e7e3fc6ae5aa7c38ed","sha256:c749e351f8b2d4c62a88b2393989e2daafc7020322f5ec48626a01ce7d9fe908","sha256:f320728df320afc72fb96e8d8ee904ae6eb11536ed74bee459e4fae59013b29b","sha256:fbb59a3e2eec5c0df75ae0f1e6b4cda050ed153fe3363f59c85dcfb250f00bac"]}],"invalid_events":[],"applied_event_ids":["sha256:b8cf3c9c376b30f1b0d2901dfb8359457a8af707cb9b837411d5e99c421ca749","sha256:0eb8c65162a90d15caf141acd929c57b7689b943a9f0103cff02bfc2adc5492b"],"state_sha256":"0f875d0378e6353748c9a7369abda1872d42eeb59eb447e3b3f807b31935c3c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zwlWwML90LPnVDe3KCi4fYE12lEydee0E6gOE/ICIyZOCYO8zrjqI5A4P5gVwWUy10YV4gk9f1c87K+j4wsYCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T23:20:31.608755Z","bundle_sha256":"d5e32bc7a8cf9b6b690992bcfd8d563b91ff79653b98d6abae571aac870893b9"}}