{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MQIPB55G4U2DQO2RXV5YPC4YKX","short_pith_number":"pith:MQIPB55G","schema_version":"1.0","canonical_sha256":"6410f0f7a6e534383b51bd7b878b9855f5b7fa9eea899b7e4a293b143e56e600","source":{"kind":"arxiv","id":"2605.17051","version":1},"attestation_state":"computed","paper":{"title":"Online Graph Embedding in Star Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Darya Melnyk, Julien Dallot, Maciej Pacut, Stefan Schmid","submitted_at":"2026-05-16T15:45:15Z","abstract_excerpt":"Graph embedding is a fundamental problem of mapping nodes of a guest graph into a host graph while minimizing the distance distortion, with broad applications, including virtual network embeddings into physical topologies, VLSI design, or community detection in social networks. However, in many real-world applications the guest graph changes over time and the embedding can adapt to these changes (e.g. virtual machine migration in network embeddings). Static embeddings are inherently inefficient in comparison to adaptive embeddings, but it remains an unresolved algorithmic challenge to design e"},"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":"2605.17051","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-16T15:45:15Z","cross_cats_sorted":[],"title_canon_sha256":"69fdcb056b64090224a0288f213fdd7086301da4f106a25582ddd636c3954ae0","abstract_canon_sha256":"e4edda9882e82c9f99de23df2d8caeb5f8069de23ec71f655a10986536d081f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:37.915977Z","signature_b64":"+7GO3Kme6e7ceEMA76ckaF8CAuzJZ0I0Z7yKPcn5XPlwJBOCCwtldkSBO6Fd40JSA0eiOS7mXOTD61OUt98LDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6410f0f7a6e534383b51bd7b878b9855f5b7fa9eea899b7e4a293b143e56e600","last_reissued_at":"2026-05-20T00:03:37.915330Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:37.915330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Graph Embedding in Star Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Darya Melnyk, Julien Dallot, Maciej Pacut, Stefan Schmid","submitted_at":"2026-05-16T15:45:15Z","abstract_excerpt":"Graph embedding is a fundamental problem of mapping nodes of a guest graph into a host graph while minimizing the distance distortion, with broad applications, including virtual network embeddings into physical topologies, VLSI design, or community detection in social networks. However, in many real-world applications the guest graph changes over time and the embedding can adapt to these changes (e.g. virtual machine migration in network embeddings). Static embeddings are inherently inefficient in comparison to adaptive embeddings, but it remains an unresolved algorithmic challenge to design e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.17051","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/2605.17051/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T22:33:23.826292Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T22:21:57.769214Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"be6cd06715a21d11ac6a553c1ea7e41afe66fd3704377b6a7992d8b15513985b"},"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":"2605.17051","created_at":"2026-05-20T00:03:37.915459+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.17051v1","created_at":"2026-05-20T00:03:37.915459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17051","created_at":"2026-05-20T00:03:37.915459+00:00"},{"alias_kind":"pith_short_12","alias_value":"MQIPB55G4U2D","created_at":"2026-05-20T00:03:37.915459+00:00"},{"alias_kind":"pith_short_16","alias_value":"MQIPB55G4U2DQO2R","created_at":"2026-05-20T00:03:37.915459+00:00"},{"alias_kind":"pith_short_8","alias_value":"MQIPB55G","created_at":"2026-05-20T00:03:37.915459+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/MQIPB55G4U2DQO2RXV5YPC4YKX","json":"https://pith.science/pith/MQIPB55G4U2DQO2RXV5YPC4YKX.json","graph_json":"https://pith.science/api/pith-number/MQIPB55G4U2DQO2RXV5YPC4YKX/graph.json","events_json":"https://pith.science/api/pith-number/MQIPB55G4U2DQO2RXV5YPC4YKX/events.json","paper":"https://pith.science/paper/MQIPB55G"},"agent_actions":{"view_html":"https://pith.science/pith/MQIPB55G4U2DQO2RXV5YPC4YKX","download_json":"https://pith.science/pith/MQIPB55G4U2DQO2RXV5YPC4YKX.json","view_paper":"https://pith.science/paper/MQIPB55G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.17051&json=true","fetch_graph":"https://pith.science/api/pith-number/MQIPB55G4U2DQO2RXV5YPC4YKX/graph.json","fetch_events":"https://pith.science/api/pith-number/MQIPB55G4U2DQO2RXV5YPC4YKX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MQIPB55G4U2DQO2RXV5YPC4YKX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MQIPB55G4U2DQO2RXV5YPC4YKX/action/storage_attestation","attest_author":"https://pith.science/pith/MQIPB55G4U2DQO2RXV5YPC4YKX/action/author_attestation","sign_citation":"https://pith.science/pith/MQIPB55G4U2DQO2RXV5YPC4YKX/action/citation_signature","submit_replication":"https://pith.science/pith/MQIPB55G4U2DQO2RXV5YPC4YKX/action/replication_record"}},"created_at":"2026-05-20T00:03:37.915459+00:00","updated_at":"2026-05-20T00:03:37.915459+00:00"}