{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:TABLQLWIESO3XSSAGFVXJMNUHQ","short_pith_number":"pith:TABLQLWI","canonical_record":{"source":{"id":"2110.04933","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-10-11T00:03:42Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ab04e70f481dbaa135ca9541a644fe9779c174a140069da4468f7da197d5527e","abstract_canon_sha256":"b223720f03c98244d9815f7fae454f07b0ffe1cff2c9b6606d4374aa8eb8d45e"},"schema_version":"1.0"},"canonical_sha256":"9802b82ec8249dbbca40316b74b1b43c345b4d9663c5cf5ab0a04ebb76b96e35","source":{"kind":"arxiv","id":"2110.04933","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.04933","created_at":"2026-07-05T03:23:15Z"},{"alias_kind":"arxiv_version","alias_value":"2110.04933v2","created_at":"2026-07-05T03:23:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.04933","created_at":"2026-07-05T03:23:15Z"},{"alias_kind":"pith_short_12","alias_value":"TABLQLWIESO3","created_at":"2026-07-05T03:23:15Z"},{"alias_kind":"pith_short_16","alias_value":"TABLQLWIESO3XSSA","created_at":"2026-07-05T03:23:15Z"},{"alias_kind":"pith_short_8","alias_value":"TABLQLWI","created_at":"2026-07-05T03:23:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:TABLQLWIESO3XSSAGFVXJMNUHQ","target":"record","payload":{"canonical_record":{"source":{"id":"2110.04933","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-10-11T00:03:42Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ab04e70f481dbaa135ca9541a644fe9779c174a140069da4468f7da197d5527e","abstract_canon_sha256":"b223720f03c98244d9815f7fae454f07b0ffe1cff2c9b6606d4374aa8eb8d45e"},"schema_version":"1.0"},"canonical_sha256":"9802b82ec8249dbbca40316b74b1b43c345b4d9663c5cf5ab0a04ebb76b96e35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:23:15.243400Z","signature_b64":"psN5/1l8tCGX6bb+gC0HPa9XCk58vODPmG37GsfkNKzlVCTuHaS2i6wLzSJ7rR/WD7lqNlLF8jCQyjsLA9dcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9802b82ec8249dbbca40316b74b1b43c345b4d9663c5cf5ab0a04ebb76b96e35","last_reissued_at":"2026-07-05T03:23:15.242986Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:23:15.242986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2110.04933","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-05T03:23:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SWZ49Qmbfc4DYTOnVZBAdw4FKk26QeaF8LFQzCJZv1xHeVi2tJcNpZSuawjrzPo0//qmzhClj0HAkrMDOVqDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T10:45:19.814149Z"},"content_sha256":"2a3e1f0498d0ec5cb9c30b368081d62d0363f03999152e189ddf54dec4eb24a8","schema_version":"1.0","event_id":"sha256:2a3e1f0498d0ec5cb9c30b368081d62d0363f03999152e189ddf54dec4eb24a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:TABLQLWIESO3XSSAGFVXJMNUHQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Faster Algorithm for Maximum Independent Set on Interval Filament Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Darcy Best, Max Ward","submitted_at":"2021-10-11T00:03:42Z","abstract_excerpt":"We provide an algorithm requiring only $O(N^2)$ time to compute the maximum weight independent set of interval filament graphs. This also implies an $O(N^4)$ algorithm to compute the maximum weight induced matching of interval filament graphs. Both algorithms significantly improve upon the previous best complexities for these problems. Previously, the maximum weight independent set and maximum weight induced matching problems required $O(N^3)$ and $O(N^6)$ time respectively."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.04933","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/2110.04933/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-05T03:23:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GbIrzNb/x5J4Ny4K+zlJcHCG2C88r4zIvCMmpnl+/kgCacNmZxBhm3SMi5HkpqlCRrONfcVMKklk6bVqkRfnCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T10:45:19.814542Z"},"content_sha256":"27a69789f0c262074cf0be807afd3a2a68cf0afe8e2985a989b035dfb1463b73","schema_version":"1.0","event_id":"sha256:27a69789f0c262074cf0be807afd3a2a68cf0afe8e2985a989b035dfb1463b73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TABLQLWIESO3XSSAGFVXJMNUHQ/bundle.json","state_url":"https://pith.science/pith/TABLQLWIESO3XSSAGFVXJMNUHQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TABLQLWIESO3XSSAGFVXJMNUHQ/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-07-14T10:45:19Z","links":{"resolver":"https://pith.science/pith/TABLQLWIESO3XSSAGFVXJMNUHQ","bundle":"https://pith.science/pith/TABLQLWIESO3XSSAGFVXJMNUHQ/bundle.json","state":"https://pith.science/pith/TABLQLWIESO3XSSAGFVXJMNUHQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TABLQLWIESO3XSSAGFVXJMNUHQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:TABLQLWIESO3XSSAGFVXJMNUHQ","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":"b223720f03c98244d9815f7fae454f07b0ffe1cff2c9b6606d4374aa8eb8d45e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-10-11T00:03:42Z","title_canon_sha256":"ab04e70f481dbaa135ca9541a644fe9779c174a140069da4468f7da197d5527e"},"schema_version":"1.0","source":{"id":"2110.04933","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.04933","created_at":"2026-07-05T03:23:15Z"},{"alias_kind":"arxiv_version","alias_value":"2110.04933v2","created_at":"2026-07-05T03:23:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.04933","created_at":"2026-07-05T03:23:15Z"},{"alias_kind":"pith_short_12","alias_value":"TABLQLWIESO3","created_at":"2026-07-05T03:23:15Z"},{"alias_kind":"pith_short_16","alias_value":"TABLQLWIESO3XSSA","created_at":"2026-07-05T03:23:15Z"},{"alias_kind":"pith_short_8","alias_value":"TABLQLWI","created_at":"2026-07-05T03:23:15Z"}],"graph_snapshots":[{"event_id":"sha256:27a69789f0c262074cf0be807afd3a2a68cf0afe8e2985a989b035dfb1463b73","target":"graph","created_at":"2026-07-05T03:23:15Z","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/2110.04933/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We provide an algorithm requiring only $O(N^2)$ time to compute the maximum weight independent set of interval filament graphs. This also implies an $O(N^4)$ algorithm to compute the maximum weight induced matching of interval filament graphs. Both algorithms significantly improve upon the previous best complexities for these problems. Previously, the maximum weight independent set and maximum weight induced matching problems required $O(N^3)$ and $O(N^6)$ time respectively.","authors_text":"Darcy Best, Max Ward","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-10-11T00:03:42Z","title":"A Faster Algorithm for Maximum Independent Set on Interval Filament Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.04933","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:2a3e1f0498d0ec5cb9c30b368081d62d0363f03999152e189ddf54dec4eb24a8","target":"record","created_at":"2026-07-05T03:23:15Z","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":"b223720f03c98244d9815f7fae454f07b0ffe1cff2c9b6606d4374aa8eb8d45e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-10-11T00:03:42Z","title_canon_sha256":"ab04e70f481dbaa135ca9541a644fe9779c174a140069da4468f7da197d5527e"},"schema_version":"1.0","source":{"id":"2110.04933","kind":"arxiv","version":2}},"canonical_sha256":"9802b82ec8249dbbca40316b74b1b43c345b4d9663c5cf5ab0a04ebb76b96e35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9802b82ec8249dbbca40316b74b1b43c345b4d9663c5cf5ab0a04ebb76b96e35","first_computed_at":"2026-07-05T03:23:15.242986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:23:15.242986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"psN5/1l8tCGX6bb+gC0HPa9XCk58vODPmG37GsfkNKzlVCTuHaS2i6wLzSJ7rR/WD7lqNlLF8jCQyjsLA9dcDg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:23:15.243400Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.04933","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a3e1f0498d0ec5cb9c30b368081d62d0363f03999152e189ddf54dec4eb24a8","sha256:27a69789f0c262074cf0be807afd3a2a68cf0afe8e2985a989b035dfb1463b73"],"state_sha256":"2ad5fa4e27daf127aaa18735f94142af143a2e168a3d35257160a7c48057ed26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jlTvYz6EVpsJUvNFBCZQHzcl5OWD7vggK8vDvAidRsDUtD7lv89yjF7PyDPk8yvwKB5Mk3tUObB7B38RY4p5AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-14T10:45:19.816673Z","bundle_sha256":"1f58346515c93491ed1b0ea73b502bf4da256423093c5eceef63ecbc370af793"}}