{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RPYARZZRE3T7MSL4KPDT26KK4T","short_pith_number":"pith:RPYARZZR","canonical_record":{"source":{"id":"1902.08744","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-23T06:10:34Z","cross_cats_sorted":["cs.DS","math.CO","math.IT"],"title_canon_sha256":"622d21a72b3c67ebdce19c8849be15ff0c1beb108ade4d2961f296ebac135b35","abstract_canon_sha256":"557e0d1b89a338a8594b12960af0ef1446117044fb887eb964d68668d38bbebe"},"schema_version":"1.0"},"canonical_sha256":"8bf008e73126e7f6497c53c73d794ae4df08a0667f4ec20dde5e75944e14514f","source":{"kind":"arxiv","id":"1902.08744","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08744","created_at":"2026-07-05T02:43:25Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08744v2","created_at":"2026-07-05T02:43:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08744","created_at":"2026-07-05T02:43:25Z"},{"alias_kind":"pith_short_12","alias_value":"RPYARZZRE3T7","created_at":"2026-07-05T02:43:25Z"},{"alias_kind":"pith_short_16","alias_value":"RPYARZZRE3T7MSL4","created_at":"2026-07-05T02:43:25Z"},{"alias_kind":"pith_short_8","alias_value":"RPYARZZR","created_at":"2026-07-05T02:43:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RPYARZZRE3T7MSL4KPDT26KK4T","target":"record","payload":{"canonical_record":{"source":{"id":"1902.08744","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-23T06:10:34Z","cross_cats_sorted":["cs.DS","math.CO","math.IT"],"title_canon_sha256":"622d21a72b3c67ebdce19c8849be15ff0c1beb108ade4d2961f296ebac135b35","abstract_canon_sha256":"557e0d1b89a338a8594b12960af0ef1446117044fb887eb964d68668d38bbebe"},"schema_version":"1.0"},"canonical_sha256":"8bf008e73126e7f6497c53c73d794ae4df08a0667f4ec20dde5e75944e14514f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:43:25.792951Z","signature_b64":"WX8tU+ewUtctGjm32/kfi14P7iCc6TSTPi8SOgsd9rWNAqXX8wkrni34sgNZiVeZ9JXB44O0E7O5NPxzZEPpBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bf008e73126e7f6497c53c73d794ae4df08a0667f4ec20dde5e75944e14514f","last_reissued_at":"2026-07-05T02:43:25.792548Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:43:25.792548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.08744","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-05T02:43:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lyG0EoCuoueIoOz9J0c3VLHjNiM/9LEltr1W/q3DrybP+9nAfgk4sbweCfoH7bQlHugFVdb7/0HmH8RXYKHjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T21:22:27.352970Z"},"content_sha256":"1b867915c1d41ef2988d5575462f9baa634db215dab25373affd717e377a91a9","schema_version":"1.0","event_id":"sha256:1b867915c1d41ef2988d5575462f9baa634db215dab25373affd717e377a91a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RPYARZZRE3T7MSL4KPDT26KK4T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Greedy Algorithms for Binary de Bruijn Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Adamas Aqsa Fahreza, Martianus Frederic Ezerman, Zuling Chang","submitted_at":"2019-02-23T06:10:34Z","abstract_excerpt":"We propose a general greedy algorithm for binary de Bruijn sequences, called Generalized Prefer-Opposite (GPO) Algorithm, and its modifications. By identifying specific feedback functions and initial states, we demonstrate that most previously-known greedy algorithms that generate binary de Bruijn sequences are particular cases of our new algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08744","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/1902.08744/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-05T02:43:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LdDl3grUSfIhv5RmYrh7koUXPof/OkpW/xxLAVwZU0YV9h2Oa+AQVtTRcjckeQVAeR92iklGH/LDjV6inudJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T21:22:27.353880Z"},"content_sha256":"4637136da5e6e53d075e87261faaaeb7c63c21310a5c1eb0d8ddfe49cbe8685a","schema_version":"1.0","event_id":"sha256:4637136da5e6e53d075e87261faaaeb7c63c21310a5c1eb0d8ddfe49cbe8685a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RPYARZZRE3T7MSL4KPDT26KK4T/bundle.json","state_url":"https://pith.science/pith/RPYARZZRE3T7MSL4KPDT26KK4T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RPYARZZRE3T7MSL4KPDT26KK4T/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-10T21:22:27Z","links":{"resolver":"https://pith.science/pith/RPYARZZRE3T7MSL4KPDT26KK4T","bundle":"https://pith.science/pith/RPYARZZRE3T7MSL4KPDT26KK4T/bundle.json","state":"https://pith.science/pith/RPYARZZRE3T7MSL4KPDT26KK4T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RPYARZZRE3T7MSL4KPDT26KK4T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RPYARZZRE3T7MSL4KPDT26KK4T","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":"557e0d1b89a338a8594b12960af0ef1446117044fb887eb964d68668d38bbebe","cross_cats_sorted":["cs.DS","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-23T06:10:34Z","title_canon_sha256":"622d21a72b3c67ebdce19c8849be15ff0c1beb108ade4d2961f296ebac135b35"},"schema_version":"1.0","source":{"id":"1902.08744","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08744","created_at":"2026-07-05T02:43:25Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08744v2","created_at":"2026-07-05T02:43:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08744","created_at":"2026-07-05T02:43:25Z"},{"alias_kind":"pith_short_12","alias_value":"RPYARZZRE3T7","created_at":"2026-07-05T02:43:25Z"},{"alias_kind":"pith_short_16","alias_value":"RPYARZZRE3T7MSL4","created_at":"2026-07-05T02:43:25Z"},{"alias_kind":"pith_short_8","alias_value":"RPYARZZR","created_at":"2026-07-05T02:43:25Z"}],"graph_snapshots":[{"event_id":"sha256:4637136da5e6e53d075e87261faaaeb7c63c21310a5c1eb0d8ddfe49cbe8685a","target":"graph","created_at":"2026-07-05T02:43:25Z","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/1902.08744/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a general greedy algorithm for binary de Bruijn sequences, called Generalized Prefer-Opposite (GPO) Algorithm, and its modifications. By identifying specific feedback functions and initial states, we demonstrate that most previously-known greedy algorithms that generate binary de Bruijn sequences are particular cases of our new algorithm.","authors_text":"Adamas Aqsa Fahreza, Martianus Frederic Ezerman, Zuling Chang","cross_cats":["cs.DS","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-23T06:10:34Z","title":"On Greedy Algorithms for Binary de Bruijn Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08744","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:1b867915c1d41ef2988d5575462f9baa634db215dab25373affd717e377a91a9","target":"record","created_at":"2026-07-05T02:43:25Z","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":"557e0d1b89a338a8594b12960af0ef1446117044fb887eb964d68668d38bbebe","cross_cats_sorted":["cs.DS","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-23T06:10:34Z","title_canon_sha256":"622d21a72b3c67ebdce19c8849be15ff0c1beb108ade4d2961f296ebac135b35"},"schema_version":"1.0","source":{"id":"1902.08744","kind":"arxiv","version":2}},"canonical_sha256":"8bf008e73126e7f6497c53c73d794ae4df08a0667f4ec20dde5e75944e14514f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bf008e73126e7f6497c53c73d794ae4df08a0667f4ec20dde5e75944e14514f","first_computed_at":"2026-07-05T02:43:25.792548Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:43:25.792548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WX8tU+ewUtctGjm32/kfi14P7iCc6TSTPi8SOgsd9rWNAqXX8wkrni34sgNZiVeZ9JXB44O0E7O5NPxzZEPpBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:43:25.792951Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.08744","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b867915c1d41ef2988d5575462f9baa634db215dab25373affd717e377a91a9","sha256:4637136da5e6e53d075e87261faaaeb7c63c21310a5c1eb0d8ddfe49cbe8685a"],"state_sha256":"461494c3d31c014aae98b565c06054b8f14eb9191c5825f2128d2a7110d1d8d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SsGk/Rx8fr0cbccXtHZhGe/CXQ2HOMcSaSa7d3ULd6CbTIFJlHbsuA+Y/vR9w3tbbMeOVrB4OXKm2d4Cd/sfBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T21:22:27.359285Z","bundle_sha256":"c2013b9dd56682b19772852eed7f1bb6a6122109c9d7a0d06df1b605d07e91d3"}}