{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:T3LS4EKXQGA6IU3BOU74O4NEYK","short_pith_number":"pith:T3LS4EKX","schema_version":"1.0","canonical_sha256":"9ed72e11578181e45361753fc771a4c2b9853f7a4f03073c26c7109255f8bbbf","source":{"kind":"arxiv","id":"1307.3192","version":1},"attestation_state":"computed","paper":{"title":"Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Berthold V\\\"ocking, Martin Hoefer, Oliver G\\\"obel, Thomas Kesselheim, Thomas Schleiden","submitted_at":"2013-07-11T17:28:37Z","abstract_excerpt":"We investigate online algorithms for maximum (weight) independent set on graph classes with bounded inductive independence number like, e.g., interval and disk graphs with applications to, e.g., task scheduling and spectrum allocation. In the online setting, it is assumed that nodes of an unknown graph arrive one by one over time. An online algorithm has to decide whether an arriving node should be included into the independent set. Unfortunately, this natural and practically relevant online problem cannot be studied in a meaningful way within a classical competitive analysis as the competitiv"},"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":"1307.3192","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-11T17:28:37Z","cross_cats_sorted":[],"title_canon_sha256":"e0cc999b14ae944c95a31742888bbc9966669ff6d34898ce94f99b3965d266a1","abstract_canon_sha256":"e145c2c667bd8f52b02b9ccfb62c4fb0b9626752194f66e5ab1ec28db3959c48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:40.908629Z","signature_b64":"wQVetIt6Gg9gyo54rrPYuoGzwqEIgn0GG2dx3OrV9QxYBeTM54JlS3Gpt9ct3Zy8vlA6yGtsMfWhj3sWn/Z4DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ed72e11578181e45361753fc771a4c2b9853f7a4f03073c26c7109255f8bbbf","last_reissued_at":"2026-05-18T03:18:40.907976Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:40.907976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Berthold V\\\"ocking, Martin Hoefer, Oliver G\\\"obel, Thomas Kesselheim, Thomas Schleiden","submitted_at":"2013-07-11T17:28:37Z","abstract_excerpt":"We investigate online algorithms for maximum (weight) independent set on graph classes with bounded inductive independence number like, e.g., interval and disk graphs with applications to, e.g., task scheduling and spectrum allocation. In the online setting, it is assumed that nodes of an unknown graph arrive one by one over time. An online algorithm has to decide whether an arriving node should be included into the independent set. Unfortunately, this natural and practically relevant online problem cannot be studied in a meaningful way within a classical competitive analysis as the competitiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3192","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":""},"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":"1307.3192","created_at":"2026-05-18T03:18:40.908083+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.3192v1","created_at":"2026-05-18T03:18:40.908083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3192","created_at":"2026-05-18T03:18:40.908083+00:00"},{"alias_kind":"pith_short_12","alias_value":"T3LS4EKXQGA6","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"T3LS4EKXQGA6IU3B","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"T3LS4EKX","created_at":"2026-05-18T12:27:59.945178+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/T3LS4EKXQGA6IU3BOU74O4NEYK","json":"https://pith.science/pith/T3LS4EKXQGA6IU3BOU74O4NEYK.json","graph_json":"https://pith.science/api/pith-number/T3LS4EKXQGA6IU3BOU74O4NEYK/graph.json","events_json":"https://pith.science/api/pith-number/T3LS4EKXQGA6IU3BOU74O4NEYK/events.json","paper":"https://pith.science/paper/T3LS4EKX"},"agent_actions":{"view_html":"https://pith.science/pith/T3LS4EKXQGA6IU3BOU74O4NEYK","download_json":"https://pith.science/pith/T3LS4EKXQGA6IU3BOU74O4NEYK.json","view_paper":"https://pith.science/paper/T3LS4EKX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.3192&json=true","fetch_graph":"https://pith.science/api/pith-number/T3LS4EKXQGA6IU3BOU74O4NEYK/graph.json","fetch_events":"https://pith.science/api/pith-number/T3LS4EKXQGA6IU3BOU74O4NEYK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T3LS4EKXQGA6IU3BOU74O4NEYK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T3LS4EKXQGA6IU3BOU74O4NEYK/action/storage_attestation","attest_author":"https://pith.science/pith/T3LS4EKXQGA6IU3BOU74O4NEYK/action/author_attestation","sign_citation":"https://pith.science/pith/T3LS4EKXQGA6IU3BOU74O4NEYK/action/citation_signature","submit_replication":"https://pith.science/pith/T3LS4EKXQGA6IU3BOU74O4NEYK/action/replication_record"}},"created_at":"2026-05-18T03:18:40.908083+00:00","updated_at":"2026-05-18T03:18:40.908083+00:00"}