{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LGX2IHLXMYRMNZ4TSTFBFIKXMV","short_pith_number":"pith:LGX2IHLX","canonical_record":{"source":{"id":"1502.04514","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-16T12:41:07Z","cross_cats_sorted":[],"title_canon_sha256":"abd2de9f5d7dcffd1a9b257d4298d0dc7dd2b306ab69a11aaee4c41b2124827e","abstract_canon_sha256":"fcba6431a3597e27dfdfcfc3895cbe4a4d7a4fdebe73b825a8596499d663e00b"},"schema_version":"1.0"},"canonical_sha256":"59afa41d776622c6e79394ca12a157655d01ea6fb35c7887a720bcfb952cdcb7","source":{"kind":"arxiv","id":"1502.04514","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04514","created_at":"2026-05-18T00:51:52Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04514v1","created_at":"2026-05-18T00:51:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04514","created_at":"2026-05-18T00:51:52Z"},{"alias_kind":"pith_short_12","alias_value":"LGX2IHLXMYRM","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LGX2IHLXMYRMNZ4T","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LGX2IHLX","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LGX2IHLXMYRMNZ4TSTFBFIKXMV","target":"record","payload":{"canonical_record":{"source":{"id":"1502.04514","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-16T12:41:07Z","cross_cats_sorted":[],"title_canon_sha256":"abd2de9f5d7dcffd1a9b257d4298d0dc7dd2b306ab69a11aaee4c41b2124827e","abstract_canon_sha256":"fcba6431a3597e27dfdfcfc3895cbe4a4d7a4fdebe73b825a8596499d663e00b"},"schema_version":"1.0"},"canonical_sha256":"59afa41d776622c6e79394ca12a157655d01ea6fb35c7887a720bcfb952cdcb7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:52.418016Z","signature_b64":"Aks8KCWcXWRYQx7FpXWfnTo+m4AwzlWYQtzSmuoRpTwX9kswCgyJV8SXDdmgrXmdk+VS5Ihw+62bWWGCLY7vCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59afa41d776622c6e79394ca12a157655d01ea6fb35c7887a720bcfb952cdcb7","last_reissued_at":"2026-05-18T00:51:52.417369Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:52.417369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.04514","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-05-18T00:51:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7vLMDkgyeCAa6OZ2uxuj9AZjxmDf66eEcwb4shObKixOtdBTPOmuJwpn/nmlE2DE/PAwII4tgQaJ9DSeeExVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:53:13.418003Z"},"content_sha256":"7b42756b914876f3444e469c1e74b3db1bbc52e505b43173d653f6ad23a2055d","schema_version":"1.0","event_id":"sha256:7b42756b914876f3444e469c1e74b3db1bbc52e505b43173d653f6ad23a2055d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LGX2IHLXMYRMNZ4TSTFBFIKXMV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximal Independent Sets in Generalised Caterpillar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Neethi K.S., Sanjeev Saxena","submitted_at":"2015-02-16T12:41:07Z","abstract_excerpt":"A caterpillar graph is a tree which on removal of all its pendant vertices leaves a chordless path. The chordless path is called the backbone of the graph. The edges from the backbone to the pendant vertices are called the hairs of the caterpillar graph. Ortiz and Villanueva (C.Ortiz and M.Villanueva, Discrete Applied Mathematics, 160(3): 259-266, 2012) describe an algorithm, linear in the size of the output, for finding a family of maximal independent sets in a caterpillar graph.\n  In this paper, we propose an algorithm, again linear in the output size, for a generalised caterpillar graph, wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04514","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"},"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-05-18T00:51:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hVxJcEeChY84A9GpzyCSDkNCisvbQ7mkhmAM4Mqt/P1i56rds42xP6X8VBXbD5gg0Awl/n/jHEBMj++KRJ2FBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:53:13.418370Z"},"content_sha256":"901cb1f44bf934b0adb4bb2780079d07f3b873b385253564e4d38bf2ae894e4f","schema_version":"1.0","event_id":"sha256:901cb1f44bf934b0adb4bb2780079d07f3b873b385253564e4d38bf2ae894e4f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LGX2IHLXMYRMNZ4TSTFBFIKXMV/bundle.json","state_url":"https://pith.science/pith/LGX2IHLXMYRMNZ4TSTFBFIKXMV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LGX2IHLXMYRMNZ4TSTFBFIKXMV/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-06-03T16:53:13Z","links":{"resolver":"https://pith.science/pith/LGX2IHLXMYRMNZ4TSTFBFIKXMV","bundle":"https://pith.science/pith/LGX2IHLXMYRMNZ4TSTFBFIKXMV/bundle.json","state":"https://pith.science/pith/LGX2IHLXMYRMNZ4TSTFBFIKXMV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LGX2IHLXMYRMNZ4TSTFBFIKXMV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LGX2IHLXMYRMNZ4TSTFBFIKXMV","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":"fcba6431a3597e27dfdfcfc3895cbe4a4d7a4fdebe73b825a8596499d663e00b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-16T12:41:07Z","title_canon_sha256":"abd2de9f5d7dcffd1a9b257d4298d0dc7dd2b306ab69a11aaee4c41b2124827e"},"schema_version":"1.0","source":{"id":"1502.04514","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04514","created_at":"2026-05-18T00:51:52Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04514v1","created_at":"2026-05-18T00:51:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04514","created_at":"2026-05-18T00:51:52Z"},{"alias_kind":"pith_short_12","alias_value":"LGX2IHLXMYRM","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LGX2IHLXMYRMNZ4T","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LGX2IHLX","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:901cb1f44bf934b0adb4bb2780079d07f3b873b385253564e4d38bf2ae894e4f","target":"graph","created_at":"2026-05-18T00:51:52Z","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"},"paper":{"abstract_excerpt":"A caterpillar graph is a tree which on removal of all its pendant vertices leaves a chordless path. The chordless path is called the backbone of the graph. The edges from the backbone to the pendant vertices are called the hairs of the caterpillar graph. Ortiz and Villanueva (C.Ortiz and M.Villanueva, Discrete Applied Mathematics, 160(3): 259-266, 2012) describe an algorithm, linear in the size of the output, for finding a family of maximal independent sets in a caterpillar graph.\n  In this paper, we propose an algorithm, again linear in the output size, for a generalised caterpillar graph, wh","authors_text":"Neethi K.S., Sanjeev Saxena","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-16T12:41:07Z","title":"Maximal Independent Sets in Generalised Caterpillar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04514","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:7b42756b914876f3444e469c1e74b3db1bbc52e505b43173d653f6ad23a2055d","target":"record","created_at":"2026-05-18T00:51:52Z","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":"fcba6431a3597e27dfdfcfc3895cbe4a4d7a4fdebe73b825a8596499d663e00b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-16T12:41:07Z","title_canon_sha256":"abd2de9f5d7dcffd1a9b257d4298d0dc7dd2b306ab69a11aaee4c41b2124827e"},"schema_version":"1.0","source":{"id":"1502.04514","kind":"arxiv","version":1}},"canonical_sha256":"59afa41d776622c6e79394ca12a157655d01ea6fb35c7887a720bcfb952cdcb7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59afa41d776622c6e79394ca12a157655d01ea6fb35c7887a720bcfb952cdcb7","first_computed_at":"2026-05-18T00:51:52.417369Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:52.417369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Aks8KCWcXWRYQx7FpXWfnTo+m4AwzlWYQtzSmuoRpTwX9kswCgyJV8SXDdmgrXmdk+VS5Ihw+62bWWGCLY7vCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:52.418016Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.04514","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b42756b914876f3444e469c1e74b3db1bbc52e505b43173d653f6ad23a2055d","sha256:901cb1f44bf934b0adb4bb2780079d07f3b873b385253564e4d38bf2ae894e4f"],"state_sha256":"6ee41b5b938c43e32e0e806fb2ff0cb1c1d1ba603007c9d73230af4a51160644"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hDH0Ly7pJzKFJe0mLreYLfOaHx7L9/NHDgHrplSJpBhvapjc3cKHKo6+p/2ETyni8uxbTHzVqqRA/OK5XxqwCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:53:13.420258Z","bundle_sha256":"b878fe705a72fd807be2b61d772fbcef2c2e8bc38d5356312e3ade92915d682f"}}